Generically Nilpotent Cellular Automata

arXiv2108.12925MaRDI QIDQ6376286FDOQ6376286

Authors: Ilkka A. Törmä 

Publication date: 29 August 2021

Abstract: We study the generic limit sets of one-dimensional cellular automata, which intuitively capture their asymptotic dynamics while discarding transient phenomena. As our main results, we characterize the automata whose generic limit set is a singleton, and show that this class is $Sigm{a}_2^0$-complete. We also prove that given a CA whose generic limit set is guaranteed to be a singleton, the sole configuration it contains cannot be algorithmically determined.

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15)

This page was built for publication: Generically Nilpotent Cellular Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6376286)