Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton
From MaRDI portal
Publication:611750
DOI10.1016/j.mcm.2010.02.006zbMath1201.68072OpenAlexW1994084517MaRDI QIDQ611750
Genaro J. Martínez, Andrew Wuensche, Liang Zhang, Andrew Adamatzky
Publication date: 14 December 2010
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2010.02.006
Cites Work
- Collision-based implementation of a two-bit adder in excitable cellular automaton
- Glider-based computing in reaction-diffusion hexagonal cellular automata
- Construction universality in purely asynchronous cellular automata
- Conservative logic
- Experimental implementation of collision-based gates in Belousov-Zhabotinsky medium
- FAULT-TOLERANT NANOCOMPUTERS BASED ON ASYNCHRONOUS CELLULAR AUTOMATA
- ON SPIRAL GLIDER-GUNS IN HEXAGONAL CELLULAR AUTOMATA: ACTIVATOR-INHIBITOR PARADIGM
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton