Shift-equivalence of \(k\)-ary, one-dimensional cellular automata rules
From MaRDI portal
Publication:2207952
DOI10.1016/j.cnsns.2018.03.017OpenAlexW2795298936MaRDI QIDQ2207952
Eric Goles Chacc, Eurico L. P. Ruivo, Fabiola Lobos, Pedro P. B. de Oliveira
Publication date: 23 October 2020
Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cnsns.2018.03.017
Related Items (3)
A decomposition theorem for number-conserving multi-state cellular automata on triangular grids ⋮ Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates ⋮ From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the parity problem in one-dimensional cellular automata
- Computation theory of cellular automata
- Quantum field as a quantum cellular automaton: the Dirac free evolution in one dimension
- Theory of cellular automata: a survey
- Subshifts of finite type and sofic systems
- Irreducibility and computational equivalence. 10 years after Wolfram's a new kind of science
- Self-organized societies: on the Sakoda model of social interactions
- A fuzzy delay approach for HIV dynamics using a cellular automaton
- A full computation-relevant topological dynamics classification of elementary cellular automata
- EXTENDING CHUA'S GLOBAL EQUIVALENCE THEOREM ON WOLFRAM'S NEW KIND OF SCIENCE
- Strong shift equivalence theory and the shift equivalence problem
- A NONLINEAR DYNAMICS PERSPECTIVE OF WOLFRAM'S NEW KIND OF SCIENCE PART I: THRESHOLD OF COMPLEXITY
- The shift equivalence problem.
This page was built for publication: Shift-equivalence of \(k\)-ary, one-dimensional cellular automata rules
