Abstract
We prove that each recursively enumerable language can be generated by a cooperating distributed grammar system with two Q + registers and right-linear rules.
Research supported by the Academy of Finland, project 11281
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Csuhaj-Varju, J. Dassow, On cooperating distributed grammar systems, J. Inform. Process. Cybern., EIK, 26 (1990), 49–63.
E. Csuhaj-Varju, J. Dassow, J. Kelemen, Gh. Păun, Grammar Systems. A Grammatical Aproach to Distribution and Cooperation, Gordon and Breach, London, 1994.
J. Dassow, Gh. Păun, Cooperating distributed grammar systems with registers, Found. Control Engineering, 15 (1990), 19–38.
J. Dassow, Gh. Păun, S. Vicolov, On the power of CDGS with regular components, Foundations of Computing and Decision Sciences, 18, 2 (1993), 83–108.
G. Rozenberg, A. Salomaa (eds.), Handbook of Formal Languages, Springer-Verlag, Berlin, 1997.
S. Vicolov, Cooperating distributed grammar systems with registers: the regular case, Computers and AI, 12, 1 (1993), 89–98.
S. Vicolov-Dumitrescu, Grammars, grammar systems and g.s.m. mappings with valences, in vol. Mathematical Aspects of Natural and Formal Languages (Gh. Păun, ed.), World Sci. Publ., Singapore, 1994, 473–491.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dumitrescu, S. (1997). Characterization of RE using CD grammar systems with two registers and RL rules. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_11
Download citation
DOI: https://doi.org/10.1007/3-540-62844-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62844-6
Online ISBN: 978-3-540-68703-0
eBook Packages: Springer Book Archive