A new kind of science
Information dynamics of cellular automata I: an algebraic study
Fundamenta Informaticae - Special issue on cellular automata
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
On Algebraic Structure of Neighborhoods of Cellular Automata: Horse Power Problem
Fundamenta Informaticae - Special issue on DLT'04
Variations on neighborhoods in CA
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
How does the neighborhood affect the global behavior of cellular automata?
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Changing Neighborhoods of CA: Reduced Local Structures and Embeddings for Universality
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Automorphissm Classification of Cellular Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
| Hi-index | 0.00 |
In place of the traditional definition of a cellular automaton CA = (S, Q,N, f), a new definition (S, Q, fn, υ) is given by introducing an injection called the neighborhood function v : {0, 1, ..., n - 1} → S, which provides a connection between the variables of local function fn of arity n and neighbors of CA: image(v) is a neighborhood of size n. The new definition allows new analysis of cellular automata. We first show that from a single local function countably many CA are induced by changing v and then prove that equivalence problem of such CA is decidable. Then we observe what happens if we change the neighborhood. As a typical research topics, we show that reversibility of 2 states 3 neighbors CA is preserved from changing the neighborhood, but that of 3 states CA is not.