Emulating cellular automata in chemical reaction-diffusion networks

DOI10.1007/s11047-015-9503-8zbMath1416.92198OpenAlexW622443382MaRDI QIDQ2311218

Rebecca Schulman, Dominic Scalise

Publication date: 10 July 2019

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-015-9503-8

zbMATH Keywords

cellular automatachemical reaction networkmolecular programmingDNA strand displacementprogrammable matterdistributed computationreaction-diffusion networksintelligent materials

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Classical flows, reactions, etc. in chemistry (92E20) Cellular automata (computational aspects) (68Q80)

Related Items (9)

Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions ⋮ Maximum number of periodic orbits in parallel dynamical systems ⋮ Simplifying Chemical Reaction Network Implementations with Two-Stranded DNA Building Blocks ⋮ Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs ⋮ Dynamical attraction in parallel network models ⋮ Periods in XOR parallel dynamical systems over directed dependency graphs ⋮ Enumerating periodic orbits in sequential dynamical systems over graphs ⋮ Predecessors existence problems and Gardens of Eden in sequential dynamical systems ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph automata: Natural expression of self-reproduction
• Computation with finite stochastic chemical reaction networks
• A simple three-dimensional real-time reliable cellular array
• Mathematical biology. Vol. 2: Spatial models and biomedical applications.
• Computational Design of Reaction-Diffusion Patterns Using DNA-Based Chemical Reaction Networks
• Parallel and Scalable Computation and Spatial Dynamics with DNA-Based Chemical Reaction Networks on a Surface
• Efficient Turing-Universal Computation with DNA Polymers
• Tomography of Reaction-Diffusion Microemulsions Reveals Three-Dimensional Turing Patterns
• P-completeness of Cellular Automaton Rule 110
• Cellular graph automata. I. basic concepts, graph property measurement, closure properties
• The chemical basis of morphogenesis
• ASYNCHRONOUS AUTOMATA NETWORKS CAN EMULATE ANY SYNCHRONOUS AUTOMATA NETWORK
• Modular Verification of DNA Strand Displacement Networks via Serializability Analysis
• Reachability Bounds for Chemical Reaction Networks and Strand Displacement Systems
• Timing in chemical reaction networks
• Reliable cellular automata with self-organization

This page was built for publication: Emulating cellular automata in chemical reaction-diffusion networks