Skip to main content
SpringerLink
Log in
Book cover

Logic and Program Semantics pp 271–282Cite as

On State Sequences Defined by Reaction Systems

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7230))

Abstract

The paper investigates sequences generated by reaction systems. Arbitrary sequences can be generated if the cardinalities of the sets of reactants and inhibitors are unbounded. Most of the paper investigates systems where both of these cardinalities equal 1. A general result is obtained concerning sequences generated by systems with interaction. New estimates are obtained for lengths of sequences in the non-interactive case.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brijder, R., Ehrenfeucht, A., Main, M., Rozenberg, G.: A tour of reaction systems. International Journal of Foundations of Computer Science (to appear)

    Google Scholar 

  2. Ehrenfeucht, A., Main, M., Rozenberg, G.: Functions defined by reaction systems. International Journal of Foundations of Computer Science 22, 167–178 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ehrenfeucht, A., Rozenberg, G.: Reaction Systems. Fundamenta Informaticae 76, 1–18 (2006)

    Google Scholar 

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

    MATH  Google Scholar 

  5. Salomaa, A.: Mirror images and schemes for the maximal complexity of nondeterminism. Fundamenta Informaticae (to appear)

    Google Scholar 

  6. Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theoretical Computer Science 320, 293–313 (2004)

    Article  MathSciNet  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. Computer Science Department, Cornell University, 4149 Upson Hall, 14853, Ithaca, NY, USA

    Robert L. Constable

  2. Intelligent Systems Faculty of Science, Institute for Computing and Information Sciences, Radboud University Nijmegen, Postbus 9010, 6500 GL, Nijmegen, The Netherlands

    Alexandra Silva

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Salomaa, A. (2012). On State Sequences Defined by Reaction Systems. In: Constable, R.L., Silva, A. (eds) Logic and Program Semantics. Lecture Notes in Computer Science, vol 7230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29485-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29485-3_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29484-6

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation