Advertisement

On State Sequences Defined by Reaction Systems

  • Arto Salomaa
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

reaction system inhibitor reactant state sequence interactive process 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Ehrenfeucht, A., Main, M., Rozenberg, G.: Functions defined by reaction systems. International Journal of Foundations of Computer Science 22, 167–178 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Ehrenfeucht, A., Rozenberg, G.: Reaction Systems. Fundamenta Informaticae 76, 1–18 (2006)Google Scholar
  4. 4.
    Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, New York (1980)zbMATHGoogle Scholar
  5. 5.
    Salomaa, A.: Mirror images and schemes for the maximal complexity of nondeterminism. Fundamenta Informaticae (to appear)Google Scholar
  6. 6.
    Salomaa, A., Wood, D., Yu, S.: On the state complexity of reversals of regular languages. Theoretical Computer Science 320, 293–313 (2004)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Arto Salomaa
    • 1
  1. 1.Turku Centre for Computer ScienceTurkuFinland

Personalised recommendations