Parallel communicating grammar systems recent results, open problems /
First, we recall several recent results concerning the generative power of parallel communicating (PC) grammar systems, including characterizations of recursively enumerable (RE) languages starting from PC grammar systems and their languages. Then, we prove that the simple matrix languages can be ge...
Saved in:
| Main Author: | |
|---|---|
| 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/12569 |
| Summary: | First, we recall several recent results concerning the generative power of parallel communicating (PC) grammar systems, including characterizations of recursively enumerable (RE) languages starting from PC grammar systems and their languages. Then, we prove that the simple matrix languages can be generated by PC grammar systems and finally we introduce a new class of PC grammar systems: when a component has to communicate, it may transmit any non-empty prefix of its current sentential form. Each RE language is the morphic image of the intersection with a regular language of a language generated by such a system. A series of open problems are pointed out in this context. |
|---|---|
| Physical Description: | 381-395 |
| ISSN: | 0324-721X |