Abstract
Here we consider a simplest version of reaction-diffusion automaton: a two-dimensional cellular automaton, where a cell has eight closest neighbours and takes two states, 0 and 1. We earmark state 0 as a substrate and state 1 as a reagent. To imitate diffusion and reaction we allow state 1 to spread: a cell in state 0 takes state 1 – under certain conditions – if it has some neighbours in state 1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Adamatzky, A. (2013). Reaction-Diffusion Binary-State Automata. In: Reaction-Diffusion Automata: Phenomenology, Localisations, Computation. Emergence, Complexity and Computation, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31078-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-31078-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31077-5
Online ISBN: 978-3-642-31078-2
eBook Packages: EngineeringEngineering (R0)