Skip to main content
SpringerLink
Log in

Subapical bracketed L-systems

  • Biology
  • Conference paper
  • First Online:
Graph Grammars and Their Application to Computer Science (Graph Grammars 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1073))

Abstract

This paper characterizes the development of modular branching structures that satisfy three assumptions: (a) subapical branching, meaning that new branches can be created only near the apices of the existing branches, (b) finite number of module types and states, and (c) absence of interactions between coexisting components of the growing structure. These assumptions are captured in the notion of subapical bracketed deterministic L-systems without interactions (sBDOL-systems). We present the biological rationale for sBDOL-systems and prove that it is decidable whether a given BDOL-system is subapical or not. In addition, using the assumption that modules, once created, continue to exist, we show that (propagating) sBDOL-systems are too weak to generate acrotonic and mesotonic branching structures, which are often observed in nature. Their development must therefore be controlled by more involved mechanisms, overriding at least one of the assumptions (a-c) above.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Bălănescu, M. Gheorghe, and Gh. Păun. Three variants of apical growth filamentous systems. Int. J. of Computer Mathematics, 22:227–238, 1987.

    Google Scholar 

  2. A. Bell. Plant form: An illustrated guide to flowering plants. Oxford University Press, Oxford, 1991.

    Google Scholar 

  3. D. Frijters and A. Lindenmayer. A model for the growth and flowering of Aster novae-angliae on the basis of table (1,0)L-systems. In G. Rozenberg and A. Salomaa, editors, L Systems, Lecture Notes in Computer Science 15, pages 24–52. Springer-Verlag, Berlin, 1974.

    Google Scholar 

  4. D. Frijters and A. Lindenmayer. Developmental descriptions of branching patterns with paracladial relationships. In A. Lindenmayer and G. Rozenberg, editors, Automata, languages, development, pages 57–73. North-Holland, Amsterdam, 1976.

    Google Scholar 

  5. J. M. Janssen and A. Lindenmayer. Models for the control of branch positions and flowering sequences of capitula in Mycelis muralis (L.) Dumont (Compositae). New Phytologist, 105:191–220, 1987.

    Google Scholar 

  6. H. Jürgensen, H. Shyr, and G. Thierrin. Monoids with disjunctive identity and their codes. Acta Mathematica Hungarica, 47(3–4):299–312, 1986.

    Google Scholar 

  7. A. Kelemenová. Complexity of L-systems. In G. Rozenberg and A. Salomaa, editors, The book of L, pages 179–191. Springer-Verlag, Berlin, 1986.

    Google Scholar 

  8. A. Lindenmayer. Mathematical models for cellular interaction in development, Parts I and II. Journal of Theoretical Biology, 18:280–315, 1968.

    Google Scholar 

  9. A. Lindenmayer. Developmental systems without cellular interaction, their languages and grammars. Journal of Theoretical Biology, 30:455–484, 1971.

    Google Scholar 

  10. A. Lindenmayer. Models for multicellular development: Characterization, inference and complexity of L-systems. In A. Kelemenová and J. Kelemen, editors, Trends, techniques and problems in theoretical computer science, Lecture Notes in Computer Science 281, pages 138–168. Springer-Verlag, Berlin, 1987.

    Google Scholar 

  11. H. B. Lück and J. Lück. Approche algorithmique des structures ramifiées acrotone et basitone des végétaux. In H. Vérine, editor, La biologie théorique à Solignac, pages 111–148. Polytechnica, Paris, 1994.

    Google Scholar 

  12. J. Lück, H. B. Lück, and M. Bakkali. A comprehensive model for acrotonic, mesotonic, and basitonic branching in plants. Acta Biotheoretica, 38:257–288, 1990.

    Google Scholar 

  13. N. Nirmal and K. Krithivasan. Filamentous systems with apical growth. Int. J. of Computer Mathematics, 12:203–215, 1983.

    Google Scholar 

  14. Gh. Păun. Some further remarks on regular controlled apical growth filamentous systems. Bull. Math. de la Soc. Sci. Math. de la R. S. de Roumanie, 32(4):341–344, 1988.

    Google Scholar 

  15. P. Prusinkiewicz and A. Lindenmayer. The algorithmic beauty of plants. Springer-Verlag, New York, 1990. With J. S. Hanan, F. D. Fracchia, D. R. Fowler, M. J. M. de Boer, and L. Mercer.

    Google Scholar 

  16. P. M. Room, L. Maillette, and J. Hanan. Module and metamer dynamics and virtual plants. Advances in Ecological Research, 25:105–157, 1994.

    Google Scholar 

  17. G. Rozenberg and A. Salomaa. The mathematical theory of L systems. Academic Press, New York, 1980.

    Google Scholar 

  18. A. Salomaa. Formal languages. Academic Press, New York, 1973.

    Google Scholar 

  19. T. A. Steeves and I. M. Sussex. Patterns in plant development. Cambridge University Press, Cambridge, 1989.

    Google Scholar 

  20. K. G. Subramanian. A note on regular-controlled apical-growth filamentous systems. Intern. J. Compu. Inf. Sci., 14:235–242, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, Alberta, Canada

    Przemyslaw Prusinkiewicz

  2. Department of Mathematics, University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Lila Kari

Authors
  1. Przemyslaw Prusinkiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lila Kari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Janice Cuny Hartmut Ehrig Gregor Engels Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Prusinkiewicz, P., Kari, L. (1996). Subapical bracketed L-systems. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_111

Download citation

  • DOI: https://doi.org/10.1007/3-540-61228-9_111

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61228-5

  • Online ISBN: 978-3-540-68388-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation