Reduction of simple semi-conditional grammars with respect to the number of conditional productions
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 t...
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
2002
|
| Series: | Acta cybernetica
15 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12683 |
| Summary: | 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. |
|---|---|
| Physical Description: | 353-360 |
| ISSN: | 0324-721X |