Skip to main content
SpringerLink
Log in

On Some Biologically Motivated Control Devices for Parallel Rewriting

  • Chapter
Computation, Cooperation, and Life

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6610))

Abstract

The paper investigates Watson-Crick D0L systems, mainly over the four-letter DNA alphabet. Results are obtained concerning stability versus Fibonacci numbers, as well as classes of growth functions that are not ℤ-rational.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Csuhaj–Varjú, E., Salomaa, A.: Networks of Watson-Crick D0L systems. In: Ito, M., Imaoka, T. (eds.) Words, Languages and Combinatorics III, pp. 134–150. World Scientific Publ. Co., Singapore (2003)

    Chapter  Google Scholar 

  2. Csima, J., Csuhaj–Varjú, E., Salomaa, A.: Power and size of extended Watson-Crick L systems. Theoretical Computer Science 290, 1665–1678 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Csuhaj–Varjú, E., Martin-Vide, C., Păun, G., Salomaa, A.: From Watson-Crick L systems to Darwinian P systems. Natural Computing 2, 299–318 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)

    Book  MATH  Google Scholar 

  5. Honkala, J., Salomaa, A.: Watson-Crick D0L systems with regular triggers. Theoretical Computer Science 259, 689–698 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Mihalache, V., Salomaa, A.: Language-theoretic aspects of DNA complementarity. Theoretical Computer Science 250, 163–178 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  7. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing — New Computing Paradigms. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  8. Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)

    MATH  Google Scholar 

  9. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1-3. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  10. Salomaa, A.: Formal Languages. Academic Press, New York (1973)

    MATH  Google Scholar 

  11. Salomaa, A.: Turing, Watson-Crick and Lindenmayer. Aspects of DNA complementarity. In: Calude, C., Casti, J., Dinneen, M. (eds.) Unconventional Models of Computation, pp. 94–107. Springer, Singapore (1998)

    Google Scholar 

  12. Salomaa, A.: Watson-Crick walks and roads on D0L graphs. Acta Cybernetica 14, 179–192 (1999)

    MathSciNet  MATH  Google Scholar 

  13. Salomaa, A.: Iterated morphisms with complementarity on the DNA alphabet. In: Ito, M., Păun, G., Yu, S. (eds.) Words, Semigroups, Transductions, pp. 405–420. World Scientific Publ. Co., Singapore (2001)

    Chapter  Google Scholar 

  14. Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, Heidelberg (1978)

    Book  MATH  Google Scholar 

  15. Salomaa, A., Sosìk, P.: Watson-Crick D0L systems: the power of one transition. Theoretical Computer Science 301, 187–200 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. Sosík, P.: D0L Systems + Watson-Crick Complement = Universal Computation. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 308–320. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Turku Centre for Computer Science, Joukahaisenkatu 3–5 B, 20520, Turku, Finland

    Arto Salomaa

Authors
  1. Arto Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, Silesian University, 74601, Opava, Czech Republic

    Jozef Kelemen  & Alica Kelemenová  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Salomaa, A. (2011). On Some Biologically Motivated Control Devices for Parallel Rewriting. In: Kelemen, J., Kelemenová, A. (eds) Computation, Cooperation, and Life. Lecture Notes in Computer Science, vol 6610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20000-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20000-7_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19999-8

  • Online ISBN: 978-3-642-20000-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation