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
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
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- The complexity of optimization problems
- Reaction systems
- Fixed Points and Attractors of Reaction Systems
- Cycles and Global Attractors of Reaction Systems
- Minimal and almost minimal reaction systems
- Title not available (Why is that?)
- Developments in Language Theory
- Reaction systems and extremal combinatorics properties
- ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS
- Preimage Problems for Reaction Systems
- Polynomial Space Counting Problems
Cited In (15)
- Facilitation in reaction systems
- Evolving reaction systems
- Encoding Boolean networks into reaction systems for investigating causal dependencies in gene regulation
- Reaction systems with influence on environment
- Reaction Systems, Transition Systems, and Equivalences
- Characterization and computation of ancestors in reaction systems
- Encoding Threshold Boolean Networks into Reaction Systems for the Analysis of Gene Regulatory Networks
- Complexity of the dynamics of reaction systems
- Comparing reactions in reaction systems
- Minimal Reaction Systems Revisited and Reaction System Rank
- Reaction systems and extremal combinatorics properties
- Computing preimages and ancestors in reaction systems
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- Skeleton composition versus stable process systems in Eden
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)
