Universal Totalistic Asynchonous Cellular Automaton and Its Possible Implementation by DNA

DOI10.1007/978-3-319-41312-9_15zbMath1476.68090OpenAlexW2466354314MaRDI QIDQ2819160

Ferdinand Peper, Nobuyuki Matsui, Teijiro Isokawa, Satoshi Murata, Ibuki Kawamata, Masami Hagiya

Publication date: 28 September 2016

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-41312-9_15

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Cellular automata (computational aspects) (68Q80) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (2)

On the Persistency of Gellular Automata ⋮ Turing-completeness of asynchronous non-camouflage cellular automata

Cites Work

• Unnamed Item
• Automata and concurrency
• Cellular automata for nanometer-scale computation
• Emulating Cellular Automata in Chemical Reaction-Diffusion Networks
• On DNA-Based Gellular Automata

This page was built for publication: Universal Totalistic Asynchonous Cellular Automaton and Its Possible Implementation by DNA