Path Rewriting Cellular Automata
Path Rewriting Cellular Automata
Path rewriting cellular automata are a type of simple program that is based on ordinary cellular automaton systems. When a path rewriting cellular automaton evolves, both the cells and the topology on which they operate change at each step according to definite rules. Here, this concept is explored in the simplest of cases, using only elementary cellular automata and simple neighborhood rewrite rules. The rules specify cellular automaton uses the sequence obtained in its neighborhood not only to change its own color, but also to change which part of its neighborhood it is connected to on the following step.