Grammar systems as language analyzers and recursively enumerable languages
We consider parallel communicating grammar systems which consist of several grammars and perform derivation steps, where each of the grammars works in a parallel and synchronized manner on its own sentential form, and communication steps, where a transfer of sentential forms is done. We discuss accepting and analyzing versions of such grammar systems with context-free productions and present characterizations of the family of recursively enumerable languages by them.
In accepting parallel communicating grammar systems rules of the form α → A with a word α and a nonterminal A are applied as in the generating case, and the language consists of all terminal words which can derive the axiom. We prove that all types of these accepting grammar systems describe the family of recursively enumerable languages, even if Λ-rules are forbidden.
Moreover, we study analyzing parallel communicating grammar systems, the derivations of which perform the generating counterparts backwards. This requires a modication of the generating derivation concept to strong-returning parallel communicating grammar systems which also generate the family of recursively enumerable languages.
Unable to display preview. Download preview PDF.
- H. Bordihn and H. Fernau, Accepting grammars and systems. Technical Report 9/94, Universität Karlsruhe, Fakultät für Informatik, 1994.Google Scholar
- E. Csuhaj-Varjú, J. Dassow, J. Kelemen and Gh. Păun, Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Volume 5 of Topics in Computer Mathematics. Gordon and Breach, 1994.Google Scholar
- E. Csuhaj-Varjú and Gy. Vaszil, On context-free parallel communicating grammar systems: synchronization, communication, and normal forms. Accepted for publication in Theoretical Computer Science.Google Scholar
- J. Dassow, Gh. Păun and G. Rozenberg, Grammar systems. In: A. Salomaa and G. Rozenberg (ed.), Handbook of Formal Languages, Vol. 2, Chapter 4, Springer-Verlag, Berlin-Heidelberg, 1996, 155–213.Google Scholar
- J. Hromkovič, On the communication complexity of distributive language generation. In: J. Dassow, G. Rozenberg and A. Salomaa (ed.), Developments in Language Theory II, World Scientic Publ. Co. Pte. Ltd., 1995, 237–246.Google Scholar
- N. Mandache, On the computational power of context-free PCGSs. Submitted.Google Scholar
- A. Mateescu and A. Salomaa, Aspects of classical language theory. In: A. Salomaa and G. Rozenberg (ed.), Handbook of Formal Languages, Vol. 1, Chapter 4, Springer-Verlag, Berlin-Heidelberg, 1996, 175–251.Google Scholar
- Gh. Păun and L. Santean, Parallel communicating grammar systems: the regular case. Ann. Univ. Buc. Ser. Mat.-Inform. 37 (1989) 55–63.Google Scholar
- A. Salomaa, Formal Languages. Academic Press, 1973.Google Scholar
- Gy. Vaszil, On parallel communicating Lindenmayer systems, In: Gh. Păun and A. Salomaa (ed.), Grammatical Models of Multi-Agent Systems, Gordon and Breach, 1999, 99–112.Google Scholar