Abstract
This paper introduces three different ways of combining valences into CD grammar systems. We focus on characterizing and comparing the obtained language families. Interestingly, the underlying concepts had some anniversaries this year: Valence grammars were introduced 30 years ago, and the first paper that combined valences and CD grammar systems was published 20 years ago.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Păun, G.: A new generative device: valence grammars. Rev. Roumaine Math. Pures Appl. XXV(6), 911–924 (1980)
Csuhaj–Varjú, E., Dassow, J.: On cooperating/distributed grammar systems. J. Inf. Process. Cybern. EIK (formerly Elektron. Inf. verarb. Kybern.) 26(1/2), 49–63 (1990)
Csuhaj–Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London (1994)
Dassow, J., Păun, G.: Cooperating/distributed grammar systems with registers. Foundations of Control Engineering 15(1), 1–38 (1990)
Vicolov, S.: Cooperating/distributed grammar systems with registers: the regular case. Computers and Artificial Intelligence 12(1), 89–98 (1993)
Vicolov-Dumitrescu, S.: Grammars, grammar systems, and gsm mappings with valences. In: Păun, G. (ed.) Mathematical Aspects of Natural and Formal Languages. World Scientific Series in Computer Science, vol. 43, pp. 473–491. World Scientific, Singapore (1994)
Dumitrescu, S.: Characterizing of RE using CD grammar systems with two registers and RL rules. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 167–177. Springer, Heidelberg (1997)
Fernau, H., Stiebe, R.: Valences in Lindenmayer systems. Fundamenta Informaticae 45, 329–358 (2001)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. EATCS Monographs in Theoretical Computer Science, vol. 18. Springer, Heidelberg (1989)
Boasson, L.: An iteration theorem for one-counter languages. In: STOC, pp. 116–120. ACM, New York (1971)
Mitrana, V., Stiebe, R.: Extended finite automata over groups. Discrete Applied Mathematics 108, 287–300 (2001)
Marcus, M., Păun, G.: Valence gsm-mappings, Bull. Math. Soc. Sci. Math. Roumanie. 31(3), 219–229 (1987)
Fernau, H., Freund, R., Holzer, M.: Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. Theoretical Computer Science 259(1-2), 405–426 (2001)
Fernau, H., Holzer, M., Freund, R.: Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes ≤ k and = k. Theoretical Computer Science 299, 633–662 (2003)
Mitrana, V.: Hybrid cooperating/distributed grammar systems. Computers and Artificial Intelligence 12(1), 83–88 (1993)
Hauschildt, D., Jantzen, M.: Petri net algorithms in the theory of matrix grammars. Acta Informatica 31, 719–728 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fernau, H., Stiebe, R. (2011). On the Expressive Power of Valences in Cooperating Distributed Grammar Systems. In: Kelemen, J., Kelemenová, A. (eds) Computation, Cooperation, and Life. Lecture Notes in Computer Science, vol 6610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20000-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-20000-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19999-8
Online ISBN: 978-3-642-20000-7
eBook Packages: Computer ScienceComputer Science (R0)