Complexity of the dynamics of reaction systems
From MaRDI portal
Publication:2417853
DOI10.1016/J.IC.2019.03.006zbMath1422.68069arXiv1903.07913OpenAlexW2922484450MaRDI QIDQ2417853
Antonio E. Porreca, Enrico Formenti, Luca Manzoni, Alberto Dennunzio
Publication date: 29 May 2019
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.07913
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Symbolic dynamics (37B10)
Related Items (13)
Evolvability of reaction systems and the invisibility theorem ⋮ Fixed points and attractors of reactantless and inhibitorless reaction systems ⋮ Computational complexity of reversible reaction systems ⋮ Unnamed Item ⋮ Facilitation in reaction systems ⋮ Simulation of reaction systems by the strictly minimal ones ⋮ Controllability of reaction systems ⋮ Theory of reaction automata: a survey ⋮ Ranks of strictly minimal reaction systems induced by permutations ⋮ Functional equivalence and a cover relation for reaction systems ⋮ Comparing reactions in reaction systems ⋮ Complexity of local, global and universality properties in finite dynamical systems ⋮ On the computational complexity of reaction systems, revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of model checking for reaction systems
- Investigating dynamic causalities in reaction systems
- \(m\)-asynchronous cellular automata: from fairness to quasi-fairness
- Minimal and almost minimal reaction systems
- Local rule distributions, language complexity and non-uniform cellular automata
- Reaction systems and extremal combinatorics properties
- Computational complexity of finite asynchronous cellular automata
- An excursion in reaction systems: from computer science to biology
- Ancestors, descendants, and gardens of Eden in reaction systems
- On the complexity of occurrence and convergence problems in reaction systems
- On the computational complexity of finite cellular automata
- Surjective multidimensional cellular automata are non-wandering: a combinatorial proof
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- Reachability in Resource-Bounded Reaction Systems
- FUNCTIONAL CONSTRUCTIONS BETWEEN REACTION SYSTEMS AND PROPOSITIONAL LOGIC
- FUNCTIONS DEFINED BY REACTION SYSTEMS
- A Full Cellular Automaton to Simulate Predator-Prey Systems
- COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS
- Non-uniform Cellular Automata
- Specialized Predictor for Reaction Systems with Context Properties
- Efficient Simulation of Reaction Systems on Graphics Processing Units
- Computing Issues of Asynchronous CA
- Fixed Points and Attractors of Reaction Systems
- Reaction System Models for the Heat Shock Response
- Shifting and Lifting of Cellular Automata
- Cycles and Global Attractors of Reaction Systems
This page was built for publication: Complexity of the dynamics of reaction systems
