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, ComputationMutualistic Excitation

Reaction-Diffusion Automata: Phenomenology, Localisations, Computation: Mutualistic Excitation [In a classical Greenberg-Hasting model of excitation a resting cell excites depending on number of its excited neighbours. What if the process of being excited depends also on refractory states? Let every cell x of an automaton imitating mutualistic excitation take three states: resting ·, excited ∙, refractory ∘. and updates its state by the rule] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Reaction-Diffusion Automata: Phenomenology, Localisations, ComputationMutualistic Excitation

Download PDF
28 pages

Loading next page...
 
/lp/springer-journals/reaction-diffusion-automata-phenomenology-localisations-computation-uJWUOQWOzW

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Springer Berlin Heidelberg
Copyright
© Springer-Verlag Berlin Heidelberg 2013
ISBN
978-3-642-31077-5
Pages
67 –95
DOI
10.1007/978-3-642-31078-2_4
Publisher site
See Chapter on Publisher Site

Abstract

[In a classical Greenberg-Hasting model of excitation a resting cell excites depending on number of its excited neighbours. What if the process of being excited depends also on refractory states? Let every cell x of an automaton imitating mutualistic excitation take three states: resting ·, excited ∙, refractory ∘. and updates its state by the rule]

Published: Jan 1, 2013

There are no references for this article.