Abstract
Growth functions of context dependent Lindenmayer systems are investigated. Bounds on the fastest and slowest growth in such systems are derived, and a method to obtain (P)D1L growth functions from (P)D2L growth functions is given. Closure of context dependent growth functions under several operations is studied with special emphasis on an application of the firing squad synchronization problem. It is shown that, although all growth functions of DILs using a one letter alphabet are DOL growth functions, there are growth functions of PDILs using a two letter alphabet which are not. Several open problems concerning the decidability of growth equivalence, growth type classification etc. of context dependent growth are shown to be undecidable. As a byproduct we obtain that the language equivalence of PDILs is undecidable and that a problem proposed by Varshavsky has a negative solution.
This paper is registered at the Mathematical Center as IW 19/74.
Chapter PDF
Similar content being viewed by others
References
For results and terminology concerning these devices see e.g. M. Minsky, Computation: finite and infinite machines. Prentice-Hall, London (1967).
See e.g. Minsky, Op. cit., 28–29.
Balzer, R., An 8 state minimal solution to the firing squad synchronization problem, Inf. Contr. 10 (1967), 22–42.
Minsky, Op. cit.
The idea of simulating Tag systems with 1Ls occurs already in the first papers on L systems i.e. [33] and [12].
In: Unusual automata theory. Univ. of Aarhus, Comp. Sci. Dept. Tech. Rept. DAIMI PB-15 (1973), 20.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Vitányi, P.M.B. (1974). Growth of strings in context dependent Lindenmayer systems. In: Rozenberg, G., Salomaa, A. (eds) L Systems. Lecture Notes in Computer Science, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06867-8_8
Download citation
DOI: https://doi.org/10.1007/3-540-06867-8_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06867-9
Online ISBN: 978-3-540-37823-5
eBook Packages: Springer Book Archive