On semi-conditional grammars with productions having either forbidding or permitting conditions
This paper simplifies semi-conditional grammars so their productions have no more than one associated word-either a permitting condition or a forbidding condition. It is demonstrated that this simplification does not decrease the power of semi-conditional grammars.
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
1994
|
| Series: | Acta cybernetica
11 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12535 |
| Summary: | This paper simplifies semi-conditional grammars so their productions have no more than one associated word-either a permitting condition or a forbidding condition. It is demonstrated that this simplification does not decrease the power of semi-conditional grammars. |
|---|---|
| Physical Description: | 307-323 |
| ISSN: | 0324-721X |