Meduna Alexander and Švec Martin: Reduction of simple semi-conditional grammars with respect to the number of conditional productions. In: Acta cybernetica, (15) 3. pp. 353-360. (2002)
Preview |
Cikk, tanulmány, mű
cybernetica_015_numb_003_353-360.pdf Download (649kB) | Preview |
Abstract
The present paper discusses the descriptional complexity of simple semiconditional grammars with respect to the number of conditional productions. More specifically, it demonstrates that for every phrase-structure grammar, there exists an equivalent simple semi-conditional grammar that has no more than twelve conditional productions.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 2002 |
| Volume: | 15 |
| Number: | 3 |
| ISSN: | 0324-721X |
| Page Range: | pp. 353-360 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38513/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: 360. p. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:25 |
| Last Modified: | 2022. Jun. 14. 14:43 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12683 |
Actions (login required)
 |
View Item |
