Generically Nilpotent Cellular Automata
From MaRDI portal
Publication:6376286
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 -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.
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)
