On DNA-based gellular automata
From MaRDI portal
Recommendations
- Universal totalistic asynchonous cellular automaton and its possible implementation by DNA
- Discrete DNA Reaction-Diffusion Model for Implementing Simple Cellular Automaton
- On the Persistency of Gellular Automata
- Molecular implementations of cellular automata
- On cellular automata rules of molecular arrays
Cites work
Cited in
(17)- Self-stabilizing gellular automata
- On cellular automata rules of molecular arrays
- Reversible computing from a programming language perspective
- Cellular automata approach for characterizing of DNA tile computing
- Discrete DNA Reaction-Diffusion Model for Implementing Simple Cellular Automaton
- Universal totalistic asynchonous cellular automaton and its possible implementation by DNA
- Molecular computers for molecular robots as hybrid systems
- Emergent computing of one-dimensional DNA cellular automata based on Langton parameter
- scientific article; zbMATH DE number 3887502 (Why is no real title available?)
- Describing DNA automata using an artificial chemistry based on pattern matching and recombination
- scientific article; zbMATH DE number 1738639 (Why is no real title available?)
- Molecular implementations of cellular automata
- On the Persistency of Gellular Automata
- Shift-symmetric configurations in two-dimensional cellular automata: irreversibility, insolvability, and enumeration
- Turing-completeness of asynchronous non-camouflage cellular automata
- Universal logic elements constructed on the Turing tumble
- New cellular automaton designed to simulate geometration in gel electrophoresis
This page was built for publication: On DNA-based gellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945537)