Extremal Combinatorics of Reaction Systems

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.
Liste complète des métadonnées

Contributeur : Enrico Formenti <>
Soumis le : dimanche 8 mai 2016 - 10:12:59
Dernière modification le : mercredi 31 janvier 2018 - 10:24:06




Alberto Dennunzio, Enrico Formenti, Luca Manzoni. Extremal Combinatorics of Reaction Systems. Language and Automata Theory and Applications (LATA 2014), Mar 2014, Madrid, Spain. Springer, 8370, pp.297-307, 2014, Lecture Notes in Computer Science. 〈http://grammars.grlmc.com/LATA2014/〉. 〈10.1007/978-3-319-04921-2_24〉. 〈hal-01312661〉



Consultations de la notice