Period lengths of cellular automata cam-90 with memory | Zendy

Yasuo Kawahara | Zendy; Hyen Yeal Lee | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Period lengths of cellular automata cam-90 with memory

Author(s) -

Yasuo Kawahara,

Hyen Yeal Lee

Publication year - 1997

Publication title -

journal of mathematical physics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.708

H-Index - 119

eISSN - 1089-7658

pISSN - 0022-2488

DOI - 10.1063/1.531841

Subject(s) - cellular automaton , continuous spatial automaton , kernel (algebra) , period (music) , automaton , finite state machine , mathematics , quantum finite automata , field (mathematics) , quantum cellular automaton , computer science , automata theory , discrete mathematics , pure mathematics , algorithm , theoretical computer science , physics , acoustics

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 F2={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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research