Computer Science – Formal Languages and Automata Theory
Scientific paper
2009-08-06
Mathematical and Computer Modelling, Volume 52, Issues 1-2, July 2010, Pages 177-190
Computer Science
Formal Languages and Automata Theory
Scientific paper
10.1016/j.mcm.2010.02.006
We study transformations of 2-, 4- and 6-bit numbers in interactions between traveling and stationary localizations in the Spiral Rule reaction-diffusion cellular automaton. The Spiral Rule automaton is a hexagonal ternary-state two-dimensional cellular automaton -- a finite-state machine imitation of an activator-inhibitor reaction-diffusion system. The activator is self-inhibited in certain concentrations. The inhibitor dissociates in the absence of the activator. The Spiral Rule cellular automaton has rich spatio-temporal dynamics of traveling (glider) and stationary (eater) patterns. When a glider brushes an eater the eater may slightly change its configuration, which is updated once more every next hit. We encode binary strings in the states of eaters and sequences of gliders. We study what types of binary compositions of binary strings are implementable by sequences of gliders brushing an eater. The models developed will be used in future laboratory designs of reaction-diffusion chemical computers.
Adamatzky Andrew
Martinez Genaro
Wuensche Andrew
Zhang Liang
No associations
LandOfFree
Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-705924