Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Reaction-Diffusion Automata: Phenomenology, Localisations, ComputationReaction-Diffusion Binary-State Automata

Reaction-Diffusion Automata: Phenomenology, Localisations, Computation: Reaction-Diffusion... [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Reaction-Diffusion Automata: Phenomenology, Localisations, ComputationReaction-Diffusion Binary-State Automata

Download PDF
15 pages

Loading next page...
 
/lp/springer-journals/reaction-diffusion-automata-phenomenology-localisations-computation-vz0eckLBuu
Publisher
Springer Berlin Heidelberg
Copyright
© Springer-Verlag Berlin Heidelberg 2013
ISBN
978-3-642-31077-5
Pages
21 –35
DOI
10.1007/978-3-642-31078-2_2
Publisher site
See Chapter on Publisher Site

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.]

Published: Jan 1, 2013

Keywords: Cellular Automaton; Voronoi Diagram; Refractory State; State Transition Rule; Reaction Interval

There are no references for this article.