Pattern graphs of cellular automata and reaction systems

DOI10.1007/978-3-032-15641-9_24MaRDI QIDQ7348953zbMATH OpenFDO

Authors Kyle Ambrose, Daniela Genova, Troy Kidd

Publication date 15 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-15641-9_24

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• A graph isomorphism condition and equivalence of reaction systems
• A tour of reaction systems
• Algebraic properties of cellular automata
• An excursion in reaction systems: from computer science to biology
• Controllability of reaction systems
• Extracting reaction systems from function behavior
• Facilitation in reaction systems
• Functional equivalence and a cover relation for reaction systems
• Minimal reaction systems
• Minimizing cycles in reaction systems
• On state sequences defined by reaction systems
• Reaction systems
• Reaction systems with influence on environment
• Reaction Systems, Transition Systems, and Equivalences
• Statistical mechanics of cellular automata
• Theory of cellular automata: a survey
• Theory of self-reproducing automata. Edited and completed by Arthur W. Burks
• Universality in elementary cellular automata

This page was built for publication: Pattern graphs of cellular automata and reaction systems

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