Skip to main content
SpringerLink
Log in

Minimal and almost minimal reaction systems

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

In reaction systems introduced by Ehrenfeucht and Rozenberg the number of resources is, by definition, at least 2. If it is exactly 2, the system is referred to as minimal. We compare minimal reaction systems with almost minimal ones, where the number of resources equals 3. The difference turns out to be huge. While many central problems for minimal systems are of low polynomial complexity, the same problems in the almost minimal case are NP- or co-NP-complete. The situation resembles the difference between 2-SAT and 3-SAT, also from the point of view of techniques used. We also compare maximal sequence lengths obtainable in the two cases. We are concerned only with the most simple variant of reaction systems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Brijder R, Ehrenfeucht A, Main M, Rozenberg G (2011) A tour of reaction systems. Int J Found Comput Sci 22:1499–1517

    Article  MathSciNet  MATH  Google Scholar 

  • Ehrenfeucht A, Kleijn J, Koutny M, Rozenberg G (2012) A natural computing approach to the functioning of living cells (in press)

  • Ehrenfeucht A, Kleijn J, Koutny M, Rozenberg G (2012) Minimal reaction systems (in press)

  • Ehrenfeucht A, Main M, Rozenberg G (2011) Functions defined by reaction systems. Int J Found Comput Sci 22:167–178

    Article  MathSciNet  MATH  Google Scholar 

  • Ehrenfeucht A, Rozenberg G (2007) Reaction systems. Fundamenta Informaticae 7:263–280

    MathSciNet  Google Scholar 

  • Rozenberg G (2011) Reaction systems. A course of lectures given at the University of Turku in June

  • Salomaa A (2012) On state sequences defined by reaction systems. Springer Lect Notes Comput Sci 7230:271–282

    Google Scholar 

  • Salomaa A (2012) Functions and sequences generated by reaction systems. Theor Computer Sci 466:87–96 doi:10.1016/j.tcs.2012.07.022

    Article  MathSciNet  MATH  Google Scholar 

  • Salomaa A Functional constructions between reaction systems and propositional logic. Int J Found Comput Sci (in press)

  • Schaefer TJ (1978) The complexity of satisfiability problems. Proceedings of the 10th Annual ACM symposium on theory of computing. San Diego, pp 216–226. doi:10.1145/800133.804350

Download references

Acknowledgements

I want to thank the anonymous referees for many useful comments and suggestions.

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

Corresponding author

Correspondence to Arto Salomaa.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Salomaa, A. Minimal and almost minimal reaction systems. Nat Comput 12, 369–376 (2013). https://doi.org/10.1007/s11047-013-9372-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-013-9372-y

Keywords

Search

Navigation