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...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Păun Gheorghe
Dokumentumtípus: Cikk
Megjelent: 1996
Sorozat:Acta cybernetica 12 No. 4
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12569
Leíró adatok
Tartalmi kivonat: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.
Terjedelem/Fizikai jellemzők:381-395
ISSN:0324-721X