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. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Csuhaj-Varju, E., & Vaszil, G. (2002). Parallel communicating grammar systems with incomplete information communication*. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2295 LNCS, pp. 359–368). Springer Verlag. https://doi.org/10.1007/3-540-46011-x_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
