Surjective Span 6 Cellular Automata
Formal Languages and Automata Theory
2023-06-13 v1
Abstract
Using FSA and the construction algorithm, we generated a list of surjective span 6 cellular automata as a modest sample for our FDense program. We wanted to experimentally quantify Mike Boyle's conjecture which states that the jointly periodic points of one-dimensional cellular automata are dense. Furthermore, we wanted to know if the cardinality of cellular automata on N symbols is greater than or equal to the square root of N.
Keywords
Cite
@article{arxiv.2306.06562,
title = {Surjective Span 6 Cellular Automata},
author = {Hung Anh Vu and Nate Schnitzer and Ethan Ewing},
journal= {arXiv preprint arXiv:2306.06562},
year = {2023}
}