Skip to main content
Springer Nature Link
Log in

On the Descriptional Complexity of Some Variants of Lindenmayer Systems

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2002)

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

Included in the following conference series:

  • 349 Accesses

Abstract

We define the number of productions and the number of symbols as complexity measures for interactionless Lindenmayer systems with a completely parallel derivation process and for some variants of limited Lindenmayer systems with a partially parallel derivation process and for the associated languages. We prove that up to an initial part any natural number can occur as complexity of some language. Moreover, we show the existence of languages with small descriptional complexity with respect to one mechanism and large complexity with respect to the other device.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. H. Bordihn and J. Dassow, A note on the degree of nondeterminism. In: G. Rozenberg and A. Salomaa (Eds.), Developments in Language Theory.World Scientific, Singapore, 1994, 70–79

    Google Scholar 

  2. J. Dassow, T. Y. Nishida, and B. Reichel, Two Papers on the Descriptional Complexity of Lindenmayer Systems. Technical Report, Department of Computer Science, Otto-von-Guericke-University Magdeburg, to appear.

    Google Scholar 

  3. J. Gruska, Some classifications of context-free languages. Inform Control 14 (1969), 152–179.

    Article  MATH  MathSciNet  Google Scholar 

  4. G. T. Herman and G. Rozenberg, Developmental Systems and Languages. North-Holland, Amsterdam, 1974

    Google Scholar 

  5. A. Kelemenova and M. Removcikova, A0L and CFG-size of languages. In 10, 177–182.

    Google Scholar 

  6. J. Kleijn and G. Rozenberg, A study in parallel rewriting systems. Inform. Control 44 (1980), 134–163.

    Article  MATH  MathSciNet  Google Scholar 

  7. T. Y. Nishida, Comparisons of sizes of context-free languages among context-free grammars and 0L systems with stable and recurrent termination. J. Automata, Languages and Combinatorics 6 (2001), 507–518.

    MATH  MathSciNet  Google Scholar 

  8. B. Reichel, Some classifications of Indian parallel languages. J. Inf. Process. Cybern. (EIK) 26 (1990), 85–99.

    MathSciNet  MATH  Google Scholar 

  9. G. Rozenberg and A. Salomaa The Mathematical Theory of L Systems. Academic Press, New York, 1980

    MATH  Google Scholar 

  10. G. Rozenberg and A. Salomaa(Eds.)Lindenmayer Systems. Springer-Verlag, Berlin, 1992

    MATH  Google Scholar 

  11. D. Wätjen, k-limited 0L systems and languages. J. Inform. Process. Cybern. EIK 24 (1988), 267–285.

    MATH  Google Scholar 

  12. D. Wätjen, On k-uniformly-limited T0L systems and languages. J. Inform. Process. Cybern. EIK 26 (1990), 229–238.

    MATH  Google Scholar 

  13. T. Yokomori, D. Wood and K.-J. Lange, A three-restricted normal form for ET0L languages. Inform. Proc. Letters 14 (1982), 97–100.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, PSF 41 20, D-39016, Magdeburg, Germany

    Jürgen Dassow & Bernd Reichel

  2. Faculty of Engineering, Toyoma Prefectural University, Kosugi-machi, 939-0398, Toyoma, Japan

    Taishin Nishida

Authors
  1. Jürgen Dassow
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Taishin Nishida
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bernd Reichel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dassow, J., Nishida, T., Reichel, B. (2003). On the Descriptional Complexity of Some Variants of Lindenmayer Systems. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-45005-X_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40431-6

  • Online ISBN: 978-3-540-45005-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics