17 citations · 21 across the 9 of their papers we have counts for
9 papers · 1 filter
Counting number-conserving cellular automata with radius 1
Markus Redeker
This text is also a program that computes the number of one-dimensional number-conserving cellular automata with radius 1. At the end of the text, the numbers of such automata with…
An Invitation to Number-Conserving Cellular Automata
Markus Redeker
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a unifor…
Number Conservation via Particle Flow in One-dimensional Cellular Automata
Markus Redeker
A number-conserving cellular automaton is a simplified model for a system of interacting particles. This paper contains two related constructions by which one can find all one-dime…
Density Classification Quality of the Traffic-majority Rules
Markus Redeker
The density classification task is a famous problem in the theory of cellular automata. It is unsolvable for deterministic automata, but recently solutions for stochastic cellular…
Flexible Time and Ether in One-dimensional Cellular Automata
Markus Redeker
Flexible Time is a new formalism for calculations about one-dimensional cellular automata. It unifies the states of a finite number of cells into a single object, even if they occu…
Expressiveness of Elementary Cellular Automata
Markus Redeker, Andrew Adamatzky, Genaro J. Martínez
We investigate expressiveness, a parameter of one-dimensional cellular automata, in the context of simulated biological systems. The development of elementary cellular automata is…