Parallel Communicating Grammar Systems with Incomplete Information Communication

Authors:
Erzsébet Csuhaj-Varjú;György Vaszil
Affiliations:
-;-
Venue:
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Year:
2001

Citing 7
Cited 1

Parallel communication grammar systems: recent results, open problems

Acta Cybernetica - Special issue: selected papers of the workshop grammar systems: recent results and perspectives, Budapest, July 1996
Grammar systems

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

Theoretical Computer Science
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
Context-Free-Like Forms for the Phrase-Structure Grammars

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

Some variants in communication of parallel communicating pushdown automata

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine the generative power of parallel communicating (PC) grammar systems with context-free or E0L components communicating incomplete information, that is, only subwords of their sentential forms. We prove that these systems in most cases, even with E0L components, generate all recursively enumerable languages.