The mathematical theory of L systems

The paper gives a survey of the different areas of the theory of developmental systems and languages. It is organized in such a way that it discusses typical results obtained in each particular problem area. The results quoted may not always be the most important ones but they are quite representative for the direction of research in this theory. Proofs are not given and, consequently, the basic techniques for solving problems in this theory are not discussed. An attempt has been made to cover also the most recent results. Most of the results have not yet appeared in print. To appear in J. Tou (ed. ), Advances in Information Systems Science, Plenum Press.

[1]  Peter Johansen,et al.  Free Groups in Lindenmayer Systems , 1974, L Systems.

[2]  Mogens Nielsen,et al.  On the Decidability of Some Equivalence Problems for D0L-Systems , 1973, Inf. Control..

[3]  A. Paz.  Similarity in DTOL and related problems , 1974 .

[4]  Gabor T. Herman.  A Biologically Motivated Extension of ALGOL-like Languages , 1973, Inf. Control..

[5]  A. Salomaa.  On exponential growth in Lindenmayer systems , 1973 .

[6]  I. N. Sneddon,et al.  Theory Of Automata , 1969 .

[7]  Walter J. Savitch,et al.  Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines , 1975, Inf. Control..

[8]  Juhani Karhumäki,et al.  Some Growth Functions of Context-Dependent L-Systems , 1974, L systems.

[9]  Paul M. B. Vitányi,et al.  Growth of Strings in Context Dependent Lindenmayer Systems , 1974, L Systems.

[10]  Sven Skyum,et al.  A Relationship between ETOL and EDTOL Languages , 1974 .

[11]  Grzegorz Rozenberg.  Direct Proofs of the Undecidability of the Equivalence Problem for Sentential Forms of Linear Context-Free Grammars and the Equivalence Problem for 0L Systems , 1972, Inf. Process. Lett..

[12]  Grzegorz Rozenberg,et al.  Developmental systems with fragmentation , 1975 .

[13]  Andrzej Ehrenfeucht,et al.  A Limit Theorem for Sets of Subwords in Deterministic T0L Languages , 1973, Inf. Process. Lett..

[14]  Gabor T. Herman,et al.  Closure Properties of Some Families of Languages Associated with Biological Systems , 1974, Inf. Control..

[15]  Jan van Leeuwen,et al.  A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families , 1976, Theor. Comput. Sci..

[16]  Arto Salomaa,et al.  MACROS, Iterated Substitution and Lindenmayer AFLs , 1973 .

[17]  P. Doucet.  On the membership question in some Lindenmayer-systems , 1972 .

[18]  Andrzej Ehrenfeucht,et al.  The equality of EOL languages and codings of ol languages , 1974 .

[19]  Grzegorz Rozenberg,et al.  The Length Sets of D0L Languages are Uniformly Bounded , 1974, Inf. Process. Lett..

[20]  Grzegorz Rozenberg,et al.  On 0L-Languages , 1971, Inf. Control..

[21]  Karel Culik,et al.  Macro OL-systemsf macro , 1974 .

[22]  A. Lindenmayer.  Mathematical models for cellular interactions in development. II. Simple and branching filaments with two-sided inputs. , 1968, Journal of theoretical biology.

[23]  Grzegorz Rozenberg,et al.  On a family of acceptors for some classes of developmental languages , 1974 .

[24]  Jan van Leeuwen,et al.  Characterization of unary developmental languages , 1973, Discret. Math..

[25]  P. Vitányi.  Structure of growth in Lindenmayer systems , 1973 .

[26]  Arto Salomaa,et al.  Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems , 1973, Inf. Control..

[27]  A. Lindenmayer.  Developmental systems without cellular interactions, their languages and grammars. , 1971, Journal of theoretical biology.

[28]  Grzegorz Rozenberg.  T0L Systems and Languages , 1973, Inf. Control..

[29]  Andrzej Ehrenfeucht,et al.  Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems , 1974, ICALP.

[30]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[31]  Paul M. B. Vitányi.  Deterministic Lindenmayer Languages, Nonterminals and Homomorphisms , 1976, Theor. Comput. Sci..

[32]  Grzegorz Rozenberg,et al.  Developmental systems and languages , 1972, STOC.

[33]  Meera Blattner.  The Unsolvability of the Equality Problem for Sentential Forms of Context-Free Grammars , 1973, J. Comput. Syst. Sci..

[34]  Grzegorz Rozenberg.  Dol sequences , 1974, Discret. Math..

[35]  Arto Salomaa,et al.  On some recent problems concerning developmental languages , 1973, Automatentheorie und Formale Sprachen.

[36]  Mogens Nielsen.  EOL and ETOL Systems with Control Devices , 1974 .

[37]  Andrew Leslie Szilard,et al.  On The Algebraic Foundations Of Developmental Systems , 1974 .

[38]  Andrzej Ehrenfeucht,et al.  Three Useful Results Concerning L Languages Without Interactions , 1974, L Systems.

[39]  Karel Čnulík.  On some families of languages related to developmental systems , 1974 .

[40]  Arto Salomaa.  Solution of a decision problem concerning unary Lindenmayer systems , 1974, Discret. Math..

[41]  Juhani Karhumäki,et al.  An Example of a PD2L-System with the Growth Type 2½ , 1973, Information Processing Letters.

[42]  P. A. Christensen.  Hyper-AFL's and ET0L Systems , 1974, L Systems.

[43]  A. Lindenmayer.  Mathematical models for cellular interactions in development. I. Filaments with one-sided inputs. , 1968, Journal of theoretical biology.