PreprintarXiv licencearXiv
Random Cellular Automata and deBruijn Graphs
Abstract
Update rules of a one dimensional Cellular Automaton can be expressed using an edge-labeled deBruijn graph. We explore various questions about the image of a cellular automaton given by a randomly selected update rule by considering a random deBruijn graph.
Related
- Gardens of Eden and amenability on cellular automata
- When do lazy and invertible cellular automata generate all cellular automata?
- Elementary cellular automata: spectral properties of Koopman operator for finite periodic realizations
- Braids on the Stranded Cellular Automata Model
- A characterization of the reversibility of linear cellular automata
BibTeX
@misc{gravner2026random,
title = {{Random Cellular Automata and deBruijn Graphs}},
author = {Janko Gravner and Travis Kulhanek},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.31764},
eprint = {2610.31764},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.31764},
}
RIS
TY - UNPB
TI - Random Cellular Automata and deBruijn Graphs
AU - Janko Gravner
AU - Travis Kulhanek
PY - 2026
DA - 2026/10/22
PB - arXiv
DO - 10.48550/arxiv.2610.31764
UR - https://arxiv.org/abs/2610.31764
AB - Update rules of a one dimensional Cellular Automaton can be expressed using an edge-labeled deBruijn graph. We explore various questions about the image of a cellular automaton given by a randomly selected update rule by considering a random deBruijn graph.
ER -