Ancestors, descendants, and gardens of Eden in reaction systems

DOI10.1016/j.tcs.2015.05.046zbMath1332.68046OpenAlexW588789200MaRDI QIDQ896703

Antonio E. Porreca, Alberto Dennunzio, Luca Manzoni, Enrico Formenti

Publication date: 10 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.046

zbMATH Keywords

computational complexitydiscrete dynamical systemsnatural computingreaction systems

Mathematics Subject Classification ID

Related Items (14)

Evolving reaction systems ⋮ Characterization and computation of ancestors in reaction systems ⋮ Complexity of the dynamics of reaction systems ⋮ Computing preimages and ancestors in reaction systems ⋮ Reaction Systems, Transition Systems, and Equivalences ⋮ On the dynamical behaviour of linear higher-order cellular automata and its decidability ⋮ Reaction systems and extremal combinatorics properties ⋮ Facilitation in reaction systems ⋮ Encoding Threshold Boolean Networks into Reaction Systems for the Analysis of Gene Regulatory Networks ⋮ Encoding Boolean networks into reaction systems for investigating causal dependencies in gene regulation ⋮ Comparing reactions in reaction systems ⋮ Reaction systems with influence on environment ⋮ Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties ⋮ Minimal Reaction Systems Revisited and Reaction System Rank

Cites Work

• Unnamed Item
• Unnamed Item
• Minimal and almost minimal reaction systems
• Reaction systems and extremal combinatorics properties
• The complexity of optimization problems
• Preimage Problems for Reaction Systems
• Polynomial Space Counting Problems
• ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS
• Fixed Points and Attractors of Reaction Systems
• Cycles and Global Attractors of Reaction Systems
• Developments in Language Theory

This page was built for publication: Ancestors, descendants, and gardens of Eden in reaction systems