Abstract
Two mechanisms of controlled rewriting in table Lindenmayer systems, namely graphs and finite automata, are considered. It is shown that the finite automata concept of controlled rewriting is strongly more powerful than the graph concept of controlled rewriting according to the language generation. Moreover, a precise, natural description of the subclass of finite automata corresponding exactly to the graph controlled rewriting is found.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Braunsteinerová, E., Hromkovic, J.: Graphic controlled tabled Lindenmayer systems. In: Proc. 3rd Internat. Meeting of Young Comp. Scientists, pp. 53–59. Hungarian Academy of Sciences 1984
Dassow, J.: On the sequence equivalence problem for OL systems with controlled derivations. Computers and Artificial Intelligence 7, 97–106 (1988)
Dassow, J., Fest, U.: On regulated L systems. Rostock Math. Kolloq. 25, 99–118 (1984)
Ginsburg, S., Rozenberg, G.: TOL schemes and control set. Inform. Control 27, 109–125 (1975)
Herman, G.T., Rozenberg, G.: Developmental systems and languages. Amsterdam: North-Holland 1975
Hromkovic , J., Kupková , E.: Graph-controlled table Lindenmayer systems. J. Inf. Process. and Cybern.EIK 24, 481–493 (1988)
Pastorová , M.: Growth functions of DTOL systems controlled by Bouquet graph. Computers and Artificial Intelligence 3, 299–311 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pastorová, M. (1992). A Comparison of Two Controlled Rewriting Mechanisms for Table Lindenmayer Systems. In: Rozenberg, G., Salomaa, A. (eds) Lindenmayer Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58117-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-58117-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63474-1
Online ISBN: 978-3-642-58117-5
eBook Packages: Springer Book Archive