Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton - Computer Science > Formal Languages and Automata TheoryReportar como inadecuado




Operating binary strings using gliders and eaters in reaction-diffusion cellular automaton - Computer Science > Formal Languages and Automata Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We study transformations of 2-, 4- and 6-bit numbers in interactions betweentraveling and stationary localizations in the Spiral Rule reaction-diffusioncellular automaton. The Spiral Rule automaton is a hexagonal ternary-statetwo-dimensional cellular automaton - a finite-state machine imitation of anactivator-inhibitor reaction-diffusion system. The activator is self-inhibitedin certain concentrations. The inhibitor dissociates in the absence of theactivator. The Spiral Rule cellular automaton has rich spatio-temporal dynamicsof traveling glider and stationary eater patterns. When a glider brushes aneater the eater may slightly change its configuration, which is updated oncemore every next hit. We encode binary strings in the states of eaters andsequences of gliders. We study what types of binary compositions of binarystrings are implementable by sequences of gliders brushing an eater. The modelsdeveloped will be used in future laboratory designs of reaction-diffusionchemical computers.



Autor: Andrew Adamatzky, Genaro Martinez, Liang Zhang, Andrew Wuensche

Fuente: https://arxiv.org/







Documentos relacionados