2000 character limit reached
On the Convergence of Elementary Cellular Automata under Sequential Update Modes (2509.07797v1)
Published 9 Sep 2025 in cs.DM
Abstract: In this paper, we perform a theoretical analysis of the sequential convergence of elementary cellular automata that have at least one fixed point. Our aim is to establish which elementary rules always reach fixed points under sequential update modes, regardless of the initial configuration. In this context, we classify these rules according to whether all initial configurations converge under all, some, one or none sequential update modes, depending on if they have fixed points under synchronous (or parallel) update modes.
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.