PC grammar systems with five context-free components generate all recursively enumerable languages

Authors:
Erzsébet Csuhaj-Varjú;Gheorghe Pâun;György Vaszil
Affiliations:
Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende utca 13-17, 1111 Budapest, Hungary;Institute of Mathematics of the Romanian Academy, PO Box 1-764, 70700 Bucuresti, Romania and Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tarraco 1, 43005 ...;Computer and Automation Research Institute, Hungarian Academy of Sciences, Kende utca 13-17, 1111 Budapest, Hungary
Venue:
Theoretical Computer Science
Year:
2003

Citing 8
Cited 2

Grammar systems

Handbook of formal languages, vol. 2
On the computational completeness of context-free parallel communicating grammar systems

Theoretical Computer Science
On size complexity of context-free returning parallel communicating grammar systems

Where mathematics, computer science, linguistics and biology meet
On the computational power of context-free PC grammar systems

Theoretical Computer Science
Handbook of Formal Languages

Handbook of Formal Languages
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Parallel communicating grammar systems with bounded resources

Theoretical Computer Science
Context-Free-Like Forms for the Phrase-Structure Grammars

MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988

Non-returning PC grammar systems generate any recursively enumerable language with eight context-free components

Journal of Automata, Languages and Combinatorics
On the number of components and clusters of non-returning parallel communicating grammar systems

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems

Quantified Score

Hi-index	5.23

Visualization

Abstract

Parallel communicating grammar systems (PC grammar systems, in short) are language generating devices consisting of several context-free grammars which work synchronously on their own sentential forms and communicate the generated strings to each other by request. These systems with eleven components are known to have the power of the Turing machines. We considerably improve this result, proving that five components suffice in order to generate any recursively enumerable language.