Reaction-Diffusion Binary-State Automata

Part of the Emergence, Complexity and Computation book series (ECC, volume 1)

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.

Keywords

Cellular Automaton Voronoi Diagram Refractory State State Transition Rule Reaction Interval 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Fac. of Computing, Engineering and, Mathematical Sciences (CEMS)University of the West of EnglandBristolUnited Kingdom

Personalised recommendations