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, ComputationEvolving Localizations in Reaction-Diffusion Automata

Reaction-Diffusion Automata: Phenomenology, Localisations, Computation: Evolving Localizations in... [We consider a ternary-state totalistic hexagonal cellular automaton, where a cell updates its state depending on just the numbers, not positions, of different cell-states in its neighbourhoods. One cell-state, S, is a dedicated substrate state: a cell in state S, whose neighbourhood is filled only with states S, does not change its state (S is a an analogue of quiescent state in cellular automaton models). Two other states, A and B, are assigned to be reactants.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Reaction-Diffusion Automata: Phenomenology, Localisations, ComputationEvolving Localizations in Reaction-Diffusion Automata

Download PDF
8 pages

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

Abstract

[We consider a ternary-state totalistic hexagonal cellular automaton, where a cell updates its state depending on just the numbers, not positions, of different cell-states in its neighbourhoods. One cell-state, S, is a dedicated substrate state: a cell in state S, whose neighbourhood is filled only with states S, does not change its state (S is a an analogue of quiescent state in cellular automaton models). Two other states, A and B, are assigned to be reactants.]

Published: Jan 1, 2013

Keywords: Transition Function; Cellular Automaton; Transition Rule; Cellular Automaton Model; Solid Disc

There are no references for this article.