This paper provides some simple recursive formulas generating tran sition diagrams of finite cellular automata with triplet local transition functions.
In this paper we investigate quantum cellular automata whose global transitions are defined using a global transition function of classical cellular automata. And we prove the periodicity of behaviors of some quantum cellular automata.
Cellular automata ca-90 have states 0 and 1, and their dynamics, driven by the local transition rule 90, can be simply represented with Laurent polynomials over a finite field F 2 ϭ͕0,1͖. Cellular automata cam-90 with memory, whose configurations are pairs of those of ca-90, are introduced as a useful machinery to solve certain equations on configurations, in particular, to compute fixed or kernel configurations of ca-90. This paper defines a notion of linear dynamical systems with memory, states their basic properties, and then studies some period lengths of one-dimensional and two-dimensional cellular automata cam-90 with memory.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.