On DNA-Based Gellular Automata

DOI10.1007/978-3-319-08123-6_15zbMath1445.68093OpenAlexW167306346MaRDI QIDQ2945537

Shaoyu Wang, Ferdinand Peper, Satoshi Murata, Masami Hagiya, Teijiro Isokawa, Ibuki Kawamata, Katsunobu Imai

Publication date: 14 September 2015

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-08123-6_15

zbMATH Keywords

cellular automatamolecular computingmolecular roboticssoft matterDNA-computingDNA gel

Mathematics Subject Classification ID

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

Related Items (8)

Molecular computers for molecular robots as hybrid systems ⋮ Universal logic elements constructed on the Turing tumble ⋮ On the Persistency of Gellular Automata ⋮ Reversible computing from a programming language perspective ⋮ Turing-completeness of asynchronous non-camouflage cellular automata ⋮ Discrete DNA Reaction-Diffusion Model for Implementing Simple Cellular Automaton ⋮ Universal Totalistic Asynchonous Cellular Automaton and Its Possible Implementation by DNA ⋮ Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumeration

Cites Work

• Unnamed Item
• Unnamed Item
• P systems without multiplicities of symbol-objects
• Tissue P systems.

This page was built for publication: On DNA-Based Gellular Automata