Skip to main content
SpringerLink
Log in

Extremal Combinatorics of Reaction Systems

  • Conference paper
Language and Automata Theory and Applications (LATA 2014)

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

Abstract

Extremal combinatorics is the study of the size that a certain collection of objects must have in order to certainly satisfy a property. Reaction systems are a recent formalism for computation inspired by chemical reactions. This work is a first contribution to the study of the behaviour of large reaction systems by means of extremal combinatorics. We defined several different properties that capture some basic behaviour of a reaction system and we prove that they must necessarily be satisfied by large enough systems. Explicit bounds and formulae are also provided.

This work has been partially supported by the French National Research Agency project EMC (ANR-09-BLAN-0164).

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. Ehrenfeucht, A., Main, M., Rozenberg, G.: Combinatorics of life and death for reaction systems. International Journal of Foundations of Computer Science 21, 345–356 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ehrenfeucht, A., Rozenberg, G.: Basic notions of reaction systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 27–29. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  4. Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory. Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory. Wiley-Interscience (1990)

    Google Scholar 

  5. Jukna, S.: Extremal combinatorics: with applications in computer science. Springer (2001)

    Google Scholar 

  6. Salomaa, A.: Functional constructions between reaction systems and propositional logic. International Journal of Foundations of Computer Science 24(1), 147–159 (2013)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano - Bicocca, Viale Sarca 336, 20126, Milano, Italy

    Alberto Dennunzio

  2. Laboratoire I3S, Université Nice Sophia Antipolis, CS 40121, 06903, Sophia Antipolis CEDEX, France

    Enrico Formenti & Luca Manzoni

Authors
  1. Alberto Dennunzio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Enrico Formenti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luca Manzoni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. School of Computer Science, Department of Software Engineering and Artificial Intelligence, Complutense University of Madrid, Professor José Garcia Santesmases, 9, 28040, Madrid, Spain

    José-Luis Sierra-Rodríguez

  3. Fakultät für Informatik, Institut für Wissens- und Sprachverarbeitung, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106, Magdeburg, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Dennunzio, A., Formenti, E., Manzoni, L. (2014). Extremal Combinatorics of Reaction Systems. In: Dediu, AH., Martín-Vide, C., Sierra-Rodríguez, JL., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2014. Lecture Notes in Computer Science, vol 8370. Springer, Cham. https://doi.org/10.1007/978-3-319-04921-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-04921-2_24

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-04920-5

  • Online ISBN: 978-3-319-04921-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation