Skip to main content
SpringerLink
Log in

Array Languages and Lindenmayer Systems —A Survey

  • Chapter
The Book of L

Abstract

In 1968 Lindenmayer introduced a mathematical model of developmental systems [28]. This involves parallel rewriting in which each letter in a string is rewritten using production rules and there is no distinction between terminal and nonterminal symbols reflecting the simultaneous growth of each cell during different stages of development. Since then L-systems have been studied extensively, resulting in the number of research papers growing exponentially [19,29,54,56]. An interesting comment from a referee is a pointer to the extent to which the theory had developed within a span of five years. In 1973 we submitted a paper entitled Parallel O-Lindenmayer Languages which we abbreviated as POL [69]. Then pat came the referee’s comment: “P already stands for ’propagating’ and almost all letters of the alphabet have been used up. You may try PaOL”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abraham(1972), Compound and serial grammars, Inf. Contr. 20, 432–438.

    Google Scholar 

  2. G. Biswas(1982), Inference of array grammars under noise and distortion, Ph.D. Thesis, Michigan State Univ., East Lansing.

    Google Scholar 

  3. G. Biswas and R.C. Dubes(1984), Some experiments in two-dimensional grammatical inference, Pattern Recognition Letters 2, 173–177.

    Article  Google Scholar 

  4. F.-J. Brandenburg(1983), Uniformly growing k-th power-free homomor-phisms, Theoret. Comput. Sci. 23, 69–82.

    Google Scholar 

  5. J.W. Carlyle, S.A. Greibach, and A. Paz (1974), A two-dimensional generating system modeling growth by binary cell division, Proc. 15th SWAT conf., 1–12.

    Google Scholar 

  6. V. Claus, H. Ehrig and G. Rozenberg, Eds.(1979), Graph grammars and their application to computer science and biology, Lecture Notes in Comp. Sci. 73, Springer-Verlag, Berlin.

    Google Scholar 

  7. R. Cohen and A. Gold (1977), Theory of ω-languages I and II, J. Comput System Sc. 15, 169–208.

    Article  MathSciNet  MATH  Google Scholar 

  8. CR. Cook and P.S. Wang (1978), A Chomsky hierarchy of isotonic array grammars and languages, Comp. Graphics and Image Proc. 8, 144–152.

    Article  Google Scholar 

  9. K. Culik II and A. Lindenmayer (1974), Parallel rewriting on graphs and multidimensional development, TR CS-74-22, University of Waterloo, Waterloo, Ontario.

    Google Scholar 

  10. K. Culik II and A. Lindenmayer (1976), Parallel graph generating and graph recurrence systems for multicellular development, Int. J. General Systems 3, 33–66.

    MathSciNet  Google Scholar 

  11. K. Culik II and A. Salomaa(1981), On infinite words obtained by iterating morphisms, Theoret. Comput. Sci. 19, 29–38.

    Article  MathSciNet  Google Scholar 

  12. M.F. Dacey (1970), The syntax of a triangle and some other figures, Pattern Recognition 2, 11–31.

    Article  Google Scholar 

  13. A. Ehrenfeucht and G. Rozenberg (1981), On the subword complexity of square-free DOL languages, Theoret. Comput. Sci. 16, 25–32.

    Article  MathSciNet  MATH  Google Scholar 

  14. H. Ehrig, M. Nagl and G. Rozenberg, Eds.(1983), Graph-grammars and their application to Computer Science, Lecture Notes in Comp. Sci. 153, Springer-Verlag, Berlin.

    Google Scholar 

  15. S. Eilenberg (1974), “Automata, Languages and Machines”, Vol. A. Academic Press, New York.

    MATH  Google Scholar 

  16. E.D. Feldman (1973), Matrix grammars and parallel/sequential array automata, TR-250, Comp. Sci. Center, University of Maryland, College Park, Maryland.

    Google Scholar 

  17. K.S. Fu (1974), “Syntactic Methods in Pattern Recognition”, Academic Press, New York.

    MATH  Google Scholar 

  18. W.I. Grosky (1980), On the power of two-dimensional grammars which are not length consistent, Inf. Contr. 44, 197–221.

    Article  MathSciNet  MATH  Google Scholar 

  19. G.T. Herman and G. Rozenberg (1975), “Developmental Systems and Languages”, North-Holland, Amsterdam.

    MATH  Google Scholar 

  20. R.A. Kirsc (1964), Computer interpretation of English text and picture patterns, IEEE Trans. Computers EC-13, 363–376.

    Google Scholar 

  21. K. Krithivasan (1974), Studies in Parallelism and Picture Languages, Ph.D. Thesis, University of Madras, Madras.

    Google Scholar 

  22. K. Krithivasan (1977), Variations of the matrix models, Int. J. Comp. Math. 6, 171–190.

    Article  MathSciNet  Google Scholar 

  23. K. Krithivasan and A. Das (1984), Treating terminals as function values of time, Lecture Notes in Comp. Sci. 181, Springer-Verlag, Berlin, 188–201.

    Google Scholar 

  24. K. Krithivasan and N. Nirmal (1975), Filamentous systems with apical growth, TR-Math 04/75, Madras Christian College, Tambaram.

    Google Scholar 

  25. K. Krithivasan and N. Nirmal (1980), OL and TOL array languages, J. Indian Inst. Sc. 62A, 101–110.

    MathSciNet  Google Scholar 

  26. K. Krithivasan and R. Siromoney (1974), Array automata and operations on array languages, Int. J. Comp. Math. 4A, 3–30.

    Article  MathSciNet  Google Scholar 

  27. K. Krithivasan and R. Siromoney (1974), Characterization of regular and context-free matrices, Int. J. Comp. Math. 4A, 229–254.

    Article  MathSciNet  Google Scholar 

  28. A. Lindenmayer (1968), Mathematical models for cellular interactions in development, Parts I and II, J. Theoret. Biology 18, 280–315.

    Article  Google Scholar 

  29. A. Lindenmayer and G. Rozenberg, Eds.(1976), “Automata, Languages, Development”, North-Holland, Amsterdam.

    MATH  Google Scholar 

  30. A. Lindenmayer and G. Rozenberg (1979), Parallel generation of maps, in [6], 301–316.

    Google Scholar 

  31. M. Linna (1975), On ω-words and co-computations, Ann. Univ. Turku, Ser.Al, 168.

    Google Scholar 

  32. M. Linna (1976), On ω-sets associated with context-free languages, Inf. Contr. 31, 272–283.

    Article  MathSciNet  MATH  Google Scholar 

  33. H.A. Maurer, G. Rozenberg and E. Welzl (1982), Using string languages to describe picture languages, Inf. Contr. 54, 155–185.

    Article  MathSciNet  MATH  Google Scholar 

  34. D.L. Milgram and A. Rosenfeld (1972), Array automata and array grammars, Proc. IFIP Congress 1971, Booklet 7A-2, North-Holland, Amsterdam, 166–173.

    Google Scholar 

  35. A. Nakamura (1980), On isometric array L-systems, TR 59, Ncsdct, TIFR, Bombay.

    Google Scholar 

  36. A. Nakamura and K. Aizawa (1983), On a relationship between graph L-systems and picture languages, Theoret. Comput. Sci. 24, 161–177.

    Article  MathSciNet  MATH  Google Scholar 

  37. A. Nakamura and H. Ono (1983), Pictures of functions and their acceptability by automata, Theoret. Comput. Sci. 23, 37–48.

    Article  MathSciNet  MATH  Google Scholar 

  38. N. Nirmal (1979), Studies in two-dimensional developmental systems and languages, Ph.D. Thesis, University of Madras, Madras.

    Google Scholar 

  39. N. Nirmal (1983), The effect of nonterminals on table matrix L-systems, J. Math, and Physical Sci. 17, 183–191.

    MathSciNet  MATH  Google Scholar 

  40. N. Nirmal and K. Krithivasan (1981), EOL and ETOL array languages, Proc. Indian Acad. Sci. (Math, Sci.) 90, 167–180.

    Article  MathSciNet  MATH  Google Scholar 

  41. N. Nirmal and K. Krithivasan (1981), Control on TOL and ETOL array systems, J. Indian Inst. Sc. 63A, 97–104.

    MathSciNet  Google Scholar 

  42. N. Nirmal and K. Krithivasan (1981), Two results on table matrix L-systems, J. Indian Inst. Sc. 63A, 89–95.

    MathSciNet  Google Scholar 

  43. N. Nirmal and K. Krithivasan (1982), Table matrix L-systems, Int. J. Comp. Math. 10, 247–265.

    Article  MathSciNet  MATH  Google Scholar 

  44. N. Nirmal and K. Krithivasan (1983), Filamentous system with apical growth, Int. J. Comp. Math. 12, 203–215.

    Article  MathSciNet  MATH  Google Scholar 

  45. M. Nivat (1979), Infinite words, infinite trees and infinite computation, Mathematical Centre Tracts, 109, M.C., Amsterdam, 1–52.

    Google Scholar 

  46. R.D. Rosebrugh and D. Wood (1975), Restricted parallelism and right-linear grammar, Utilitas Math. 7, 151–186.

    MathSciNet  MATH  Google Scholar 

  47. K. Rangarajan and K.G. Subramanian (1983), Tree adjunct kolam array languages, J. Indian Inst. Sci. 64B, 277–289.

    MathSciNet  Google Scholar 

  48. A. Rosenfeld (1971), Isotonic grammars, parallel grammars and picture grammars, in “Machine Intelligence 6” (B. Meltzer and D. Michie, Eds.), 281–294, University of Edinburgh Press, Edinburgh.

    Google Scholar 

  49. A. Rosenfeld (1973), Array grammar normal forms, Inf. Contr. 23, 173–182.

    Article  MathSciNet  MATH  Google Scholar 

  50. A. Rosenfeld (1976), Some notes on finite-state picture languages, Inf. Contr. 31, 177–184.

    Article  MathSciNet  MATH  Google Scholar 

  51. A. Rosenfeld (1979), “Picture Languages”, Academic Press, New York.

    MATH  Google Scholar 

  52. A. Rosenfeld and D.L. Milgram (1973), Parallel/sequential array automata, Inform. Proc. Lett. 2, 43–46.

    Article  MathSciNet  MATH  Google Scholar 

  53. G. Rozenberg (1977), Selective substitution grammars (towards a framework for rewriting systems), Part I, Definition and examples, EIK 13(9), 455–463.

    MATH  Google Scholar 

  54. G. Rozenberg and A. Salomaa (1980), “The Mathematical Theory of L-Systems, Academic Press, New York.

    MATH  Google Scholar 

  55. A. Salomaa (1973), “Formal Languages”,Academic Press, New York.

    MATH  Google Scholar 

  56. A. Salomaa (1981),“Jewels of Formal Language Theory”, Computer Science Press, Rockville, Maryland.

    Google Scholar 

  57. P.L.J. Siero, G. Rozenberg and A. Lindenmayer (1982), Cell division patterns: Syntactic description and implementation, Comp. Graphics and Image Proc. 18, 329–346.

    Article  Google Scholar 

  58. G. Siromoney and R. Siromoney (1974), Radial grammars and biological systems, Proc. Conf. Biologically Motivated Automata Theory, McLean, Virginia, 92–96.

    Google Scholar 

  59. G. Siromoney and R. Siromoney (1975), Radial grammars and radial L-systems, Comp. Graphics and Image Proc. 4, 361–374.

    Article  Google Scholar 

  60. G. Siromoney and R. Siromoney(1976), Hexagonal arrays and rectangular blocks, Comp. Graphics and Image Proc. 5, 353–381.

    Article  Google Scholar 

  61. G. Siromoney, R. Siromoney and K. Krithivasan (1972), Abstract families of matrices and picture languages, Comp. Graphics and Image Proc. 1, 284–307.

    Article  MathSciNet  Google Scholar 

  62. G. Siromoney, R. Siromoney and K. Krithivasan (1973), Picture languages with array rewriting rules, Inf. Contr. 22, 447–470.

    Article  MathSciNet  MATH  Google Scholar 

  63. G. Siromoney, R. Siromoney and K. Krithivasan (1974), Array grammars and kolam, Comp. Graphics and Image Proc. 4, 63–82.

    Article  Google Scholar 

  64. G. Siromoney, R. Siromoney and K.G. Subramanian (1982), Stochastic table arrays, Comp. Graphics and Image Proc. 18, 202–211.

    Article  MATH  Google Scholar 

  65. G. Siromoney, K.G. Subramani an and R. Siromoney (1983), A map generating system, Proc. 3rd Conferece on FST/TCS 3, Bangalore.

    Google Scholar 

  66. R. Siromoney (1969), On equal matrix languages, Inf. Contr. 14, 135–151.

    Article  MathSciNet  MATH  Google Scholar 

  67. R. Siromoney (1969), Studies in the Mathematical Theory of Grammars and its Applications, Ph.D. Thesis, University of Madras, Madras.

    Google Scholar 

  68. R. Siromoney and V.R. Dare (1985), Infinite words obtained from selective substitution grammars, Theoret. Comput. Sci. 39, (in press).

    Google Scholar 

  69. R. Siromoney and G. Siromoney (1975), Parallel OL-Languages, Int. J. Comp. Math. Series A 5, 109–123.

    Article  MathSciNet  Google Scholar 

  70. R. Siromoney and G. Siromoney (1974), Extended controlled table arrays, TR-304, Computer Science Center, University of Maryland, College Park, Maryland.

    Google Scholar 

  71. R. Siromoney and G. Siromoney (1977), Extended controlled table L-arrays, Inf. Contr. 35, 119–138.

    Article  MathSciNet  MATH  Google Scholar 

  72. R. Siromoney and K.G. Subramanian (1981), Selective substitution array grammars, Inf. Sci. 25, 73–83.

    Article  MathSciNet  MATH  Google Scholar 

  73. R. Siromoney and K.G. Subramanian (1982), Space-filling curves and infinite graphs, in [14], 380–391.

    Google Scholar 

  74. R. Siromoney and K.G. Subramanian (1983), Very full interpretations of finite and infinite graphs, J. Math, and Physical Sci. 17, 177–182.

    MathSciNet  MATH  Google Scholar 

  75. R. Siromoney and K.G. Subramanian (1983), Generative grammar for the ‘Abbey Floor’, Bull. Eatcs 20, 160–161.

    Google Scholar 

  76. R. Siromoney and K.G. Subramanian (1985), Square-free and cube-free arrays, TR-MATH 14/85, Madras Christian College, Tambaram.

    Google Scholar 

  77. R. Siromoney, V.R. Dare and K.G. Subramanian (1983), Infinite arrays and infinite computations, Theoret. Comput. Sci. 24, 195–205.

    Article  MathSciNet  MATH  Google Scholar 

  78. R. Siromoney, K. Krithivasan and G. Siromoney (1973), N-dimensional array languages and description of crystal symmetry I, Proc. Indian Acad. Sci. 78A, 72–88.

    MathSciNet  Google Scholar 

  79. R. Siromoney, K. Krithivasan and G. Siromoney (1973), N-dimensional array languages and description of crystal symmetry II, Proc. Indian Acad. Sci. 78A, 130–139.

    MathSciNet  Google Scholar 

  80. R. Siromoney, K.G. Subramanian and V.R. Dare (1984), Infinite arrays and controlled deterministic table OL array systems, Theoret. Comput. Sci. 33, 3–11.

    Article  MathSciNet  MATH  Google Scholar 

  81. R. Siromoney, K.G. Subramanian and K. Rangarajan (1976), Parallel/ sequential rectangular arrays with tables, Int. J. Comp. Math. 6A, 143–158.

    MathSciNet  Google Scholar 

  82. R. Siromoney, K.G. Subramanian and K. Rangarajan (1976), Control on kolam arrays, Inf. Contr. 32, 272–275.

    Article  MathSciNet  MATH  Google Scholar 

  83. K.G. Subramanian (1978), Generalized context-free kolam array grammars, TR MATH 09/78, Madras Christian College, Tambaram.

    Google Scholar 

  84. K. G. Subramanian (1979), A note on regular kolam array grammars generating Kirsch’s right triangle s, Pattern Recognition 11, 343–345.

    Article  MathSciNet  MATH  Google Scholar 

  85. K. G. Subramanian (1979), Hexagonal array grammars, Comp. Graphics and Image Proc. 10, 388–394.

    Article  Google Scholar 

  86. K.G. Subramanian (1979), Studies in Array Languages, Ph.D. Thesis, University of Madras, Madras.

    Google Scholar 

  87. K.G. Subramanian (1985), A note on some variations of local adjunct grammars, Utilitas Math, (to appear).

    Google Scholar 

  88. K.G. Subramanian (1985), On a string class of extended controlled table L-array systems, TR MATH 15/85, Madras Christian College, Tambaram.

    Google Scholar 

  89. K.G. Subramanian and R. Siromoney (1982), On the generative capacity of compound string and array grammars, Inf. Sci. 26, 231–241.

    Article  MathSciNet  MATH  Google Scholar 

  90. K.G. Subramanian, R. Siromoney and G. Siromoney (1985), A note on an extension of matrix grammars generating two-dimensional languages, Inf. Sci.,(to appear).

    Google Scholar 

  91. P.S.P. Wang(1975), Sequential/parallel matrix array languages, J. Cybernetics 5, 19–36.

    Google Scholar 

  92. P.S.P. Wang(1976), Formal properties of sequential/parallel matrix languages, Proc. ACM National Conf., 12–16.

    Google Scholar 

  93. P.S.P. Wang (1980), Kierarchial structures and complexities of parallel isometric patterns, Proc. 5th Intern. Conf. on pattern recognition, Miami Beach, Florida, 819–821.

    Google Scholar 

  94. P.S.P. Wang (1981), Parallel context-free array grammar normal forms, Comp. Graphics and Image Proc. 15, 296–300.

    Article  Google Scholar 

  95. P.S.P. Wang (1982), A new hierarchyof two-dimensional array languages, Inform. Proc. Lett. 15, 223–226.

    Article  MATH  Google Scholar 

  96. P.S.P. Wang (1980), Some new results on isotonic array grammars, Inform. Proc. Lett. 10, 129–131.

    Article  MATH  Google Scholar 

  97. P.S.P. Wang and W.I. Grosky (1976), A language for two dimensional digital picture processing, Proc. ACM Symp. Graphic Languages, Miami Beach, Florida, 106–112.

    Google Scholar 

  98. L. Wegner (1982), Problem P12, Bull. Eatcs 16, 120.

    Google Scholar 

  99. E. Yodogawa (1984), A note on array grammars, Inform. Proc. Lett. 18, 51–54.

    Article  MathSciNet  MATH  Google Scholar 

  100. E. Yodogawa and N. Honda (1968), On two-dimensional grammars, Res. Rept. of the Institute of Electronics and Communication Engineers of Japan (IECEJ) A-68–41 (in Japanese).

    Google Scholar 

  101. E. Yodogawa and N. Honda (1970), On 2-dimensional pattern generating grammars, Trans. IECEJ 53-C, 141–148(in Japanese), English version in Systems Comput. Controls 1, 6-13.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Madras Christian College, Tambaram Madras, 600 059, India

    Rani Siromoney

Authors
  1. Rani Siromoney
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Siromoney, R. (1986). Array Languages and Lindenmayer Systems —A Survey. In: The Book of L. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95486-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-95486-3_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-95488-7

  • Online ISBN: 978-3-642-95486-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation