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
LEADER 01440nab a2200217 i 4500
001 acta12569
005 20220613145130.0
008 161015s1996 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Păun Gheorghe 
245 1 0 |a Parallel communicating grammar systems   |h [elektronikus dokumentum] :  |b recent results, open problems /  |c  Păun Gheorghe 
260 |c 1996 
300 |a 381-395 
490 0 |a Acta cybernetica  |v 12 No. 4 
520 3 |a 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. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
856 4 0 |u http://acta.bibl.u-szeged.hu/12569/1/cybernetica_012_numb_004_381-395.pdf  |z Dokumentum-elérés