On regular characterizations of languages by grammar systems
We show that grammar systems with communication by command and with extremely simple rewriting rules are able to generate all recursively enumerable languages. The result settles several open problems in the area of grammar systems.
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
1996
|
| Series: | Acta cybernetica
12 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12571 |
| Summary: | We show that grammar systems with communication by command and with extremely simple rewriting rules are able to generate all recursively enumerable languages. The result settles several open problems in the area of grammar systems. |
|---|---|
| Physical Description: | 411-425 |
| ISSN: | 0324-721X |