Abstract
We examine the generative power of parallel communicating 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.
Similar content being viewed by others
References
Csuhaj-VarjÚ, E., J. Dassow, J. Kelemen and Gh. Păun, Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon and Breach, Yverdon, 1994.
Csuhaj-VarjÚ, E. and Gy. Vaszil, On the computational completeness of context-free parallel communicating grammar systems. Theoretical Computer Science, 215: 349–358 (1999).
Csuhaj-VarjÚ, E. and Gy. Vaszil, Parallel communicating grammar systems with incomplete information communication. In: Proceedings of Developments in Language Theory, 5th International Conference DLT 2001, Vienna, Austria, July 16-21. Revised Papers, Vol. 2295 of Lecture Notes in Computer Science, 359-368. Kuich, W.,G. Rozenberg, and A. Salomaa, editors. Springer, Berlin, 2002. Also in Developments in Language Theory, 5th International Conference DLT 2001, Vienna, Austria, July 16-21. Preproceedings. 381-392. Kuich,W., editor. Technische Universität Wien, 2001.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Csuhaj-Varjú, E., Vaszil, G. Parallel Communicating Grammar Systems with Incomplete Information Communication. Grammars 5, 153–176 (2002). https://doi.org/10.1023/A:1022122330042
Issue Date:
DOI: https://doi.org/10.1023/A:1022122330042