Abstract
In this paper we provide a short overview of the mathematical theory of L systems. Because of the limitations on the size of this paper the overview is very concise and it treats only the small fragment of the existing theory (the choice of the material covered strongly reflects the personal point of view of the author). Still it is hoped that the reader will get an idea what are the L systems about and may be some of the readers will join the research in this interesting and very promising area.
Preview
Unable to display preview. Download preview PDF.
V. References
J. Carlyle, S. Greibach and A. Paz, A two-dimensional generating system modding growth by binary cell division, 15th Annual Symposium on Switching and Automata Theory, 1974.
K. Culik II and A. Lindenmayer, Parallel rewriting on graphs and multidimensional development, Dept. of Computer Science, University of Waterloo, Canada, Techn. Report No. CS-74-22, 1974.
P. Downey, Formal languages and recursion schemes, Ph. D. dissertation, Harvard University, 1974.
A. Ehrenfeucht and G. Rozenberg, A limit theorem for sets of subwords in deterministic T0L languages, Information Processing Letters, 2, 10–73, 1973.
A. Ehrenfeucht and G. Rozenberg, The number of occurrences of letters versus their distribution in some E0L languages, Information and Control, 26, 256–271, 1974.
A. Ehrenfeucht and G. Rozenberg, The equality of E0L languages and codings of 0L languages, International Journal of Computer Mathematics, 4, 95–104, 1974.
A. Ehrenfeucht and G. Rozenberg, Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems, Acta Informatica, 3, 265–283, 1974.
A. Ehrenfeucht and G. Rozenberg, On the (combinatorial) structure of L languages without interactions, 7th Annual ACM Symposium on Theory of Computing, 1975.
A. Ehrenfeucht and G. Rozenberg, A characterization theorem for a subclass of ET0L languages, Acta Informatica, to appear.
C. Ellis, The validation of parallel co-operating processes, Dept. of Computer Science, University of Colorado at Boulder, U.S.A., Techn. Rep. No. CU-CS-065-75, 1975.
G. T. Herman, Simulation of organisms based on L systems, 1974 Conference of Biologically Motivated Automata Theory, 1974.
G.T. Herman and G. Rozenberg, Developmental systems and languages, North-Holland Publ. Comp., Amsterdam. 1975.
G.T. Herman, A. Lindenmayer and G. Rozenberg, Description of developmental languages using recurrence systems, Mathematical Systems Theory, 8, 316–341, 1975.
J. van Leeuwen, Notes on pre-set pushdown automata, in [24], 177–189, 1974.
A. Lindenmayer, Mathematical models for cellular interactions in development, Parts I and II, Journal of Theoretical Biology, 18, 280–315, 1968.
A. Lindenmayer, Developmental systems and languages in their biological context, Chapter 0 in 12, 1975.
A. Lindenmayer, L systems in their biological context, Journ. of Theoretical Biology, to appear.
A. Paz and A. Salomaa, Integral sequential word functions and growth equivalence of Lindenmayer systems, Information and Control, 23, 313–343, 1973.
G. Rozenberg, T0L systems and languages, Information and Control, 23, 357–381, 1973.
G. Rozenberg, Extension of tabled 0L systems and languages, International Journal of Computer and Information Sciences, 2, 311–336, 1973.
G. Rozenberg, D0L sequences, Discrete Mathematics, 7, 323–347, 1974.
G. Rozenberg, On a family of acceptors for some classes of developmental languages, International Journal of Computer Mathematics, 4. 199–228, 1974.
G. Rozenberg and A. Lindenmayer, Developmental systems with locally catenative formulas, Acta Informatica, 2, 214–248, 1973.
G. Rozenberg and A. Salomaa (eds), L systems, Lecture Notes in Computer Science, v. 15, Springer-Verlag, 1974.
G. Rozenberg and A. Salomaa, The mathematical theory of L systems, Progress in Information Processing (edited by J. Tou), to appear.
C. Roman, R systems, Ph. D. thesis, Moore School of Electr. Engineering, 1975.
A. Salomaa, On exponential growth in Lindenmayer systems, Indagationes Mathematicae, 35, 23–30, 1973.
W. Savitch, Some characterizations of Lindenmayer systems in terms of Chomsky-type grammars and stack machines, Information and Control, 27, 37–60, 1975.
A Szilard, Growth functions of Lindenmayer systems, Dept. of Computer Science, University of Western Ontario, Canada, Techn. Rep. No. 4, 1971.
P. Vitanyi, Structure of growth in Lindenmayer systems, Indagationes Mathematicae, 35, 247–253, 1973.
A. Walker, Adult languages of L systems and the Chomsky hierarchy, in [24], 201–216, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rozenberg, G. (1975). L systems, sequences and languages. In: Mülbacher, J. (eds) GI — 5. Jahrestagung. GI 1975. Lecture Notes in Computer Science, vol 34. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07410-4_621
Download citation
DOI: https://doi.org/10.1007/3-540-07410-4_621
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07410-6
Online ISBN: 978-3-540-37929-4
eBook Packages: Springer Book Archive