Abstract
We design a totalistic cellular automaton, where a cell updates its state depending on just the numbers of different cell-states in its neighbourhoods.Consider a ternary state automaton, where every cell takes one of the following cell-states: substrate S, activator A and inhibitor I.
This is a preview of subscription content, log in via an institution to check access.
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). Computing in Hexagonal Reaction-Diffusion Automaton. 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_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-31078-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31077-5
Online ISBN: 978-3-642-31078-2
eBook Packages: EngineeringEngineering (R0)