Ancestors, descendants, and gardens of Eden in reaction systems

DOI10.1016/J.TCS.2015.05.046zbMATH Open1332.68046OpenAlexW588789200MaRDI QIDQ896703FDOQ896703

Authors Alberto Dennunzio, Luca Manzoni, Antonio E. Porreca, 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

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Preimage problems for reaction systems
• Characterization and computation of ancestors in reaction systems
• Computing preimages and ancestors in reaction systems
• Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
• Predecessors existence problems and Gardens of Eden in sequential dynamical systems

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• Cycles and global attractors of reaction systems
• Developments in Language Theory
• Fixed points and attractors of reaction systems
• Minimal and almost minimal reaction systems
• ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS
• Polynomial Space Counting Problems
• Preimage problems for reaction systems
• Reaction systems
• Reaction systems and extremal combinatorics properties
• The complexity of optimization problems

Cited in

(16)

• Skeleton composition versus stable process systems in Eden
• Reaction systems and extremal combinatorics properties
• Encoding threshold Boolean networks into reaction systems for the analysis of gene regulatory networks
• Reaction Systems, Transition Systems, and Equivalences
• Complexity of the dynamics of reaction systems
• Computing preimages and ancestors in reaction systems
• Facilitation in reaction systems
• Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
• Characterization and computation of ancestors in reaction systems
• Encoding Boolean networks into reaction systems for investigating causal dependencies in gene regulation
• On the dynamical behaviour of linear higher-order cellular automata and its decidability
• Reaction systems with influence on environment
• Minimal reaction systems revisited and reaction system rank
• Evolving reaction systems
• Comparing reactions in reaction systems
• Preimage problems for reaction systems

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

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