Reaction systems made simple. A normal form and a classification theorem

DOI10.1007/978-3-642-39074-6_15MaRDI QIDQ5300919zbMATH OpenOpenAlexFDO

Authors Luca Manzoni, Antonio E. Porreca

Publication date 28 June 2013

Published in Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39074-6_15

Mathematics Subject Classification ID

Recommendations

• Simple reaction systems and their classification
• Reaction systems
• Reaction systems: a model of computation inspired by the functioning of the living cell
• Reaction automata
• A tour of reaction systems

Cited in

(18)

• Reaction automata
• Simulation of reaction systems by the strictly minimal ones
• Simulating reversible computation with reaction systems
• Extremal combinatorics of reaction systems
• Efficient simulation of reaction systems on graphics processing units
• On the properties of language classes defined by bounded reaction automata
• Mutual exclusion and reversibility in reaction systems
• On the complexity of occurrence and convergence problems in reaction systems
• Reaction systems
• Simple reaction systems and their classification
• The many roads to the simulation of reaction systems
• Transactions and contracts based on reaction systems
• Functional constructions between reaction systems and propositional logic
• Steady states of constrained reaction systems
• Reaction systems and extremal combinatorics properties
• Developments in Language Theory
• Reachability in resource-bounded reaction systems
• Reaction systems: a model of computation inspired by the functioning of the living cell

This page was built for publication: Reaction systems made simple. A normal form and a classification theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300919)