2000 character limit reached
Surjective Span 6 Cellular Automata
Published 11 Jun 2023 in cs.FL | (2306.06562v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.