A Search Algorithm for the Maximal Attractor of a Cellular Automaton

DOI10.1007/978-3-540-70918-3_31zbMATH Open1167.68388OpenAlexW2104508205MaRDI QIDQ3590948FDOQ3590948

Authors Petr Kůrka, Enrico Formenti 

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_31

zbMATH Keywords

cellular automatalimit setssofic subshifts

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Stability of topological dynamical systems (37B25) Cellular automata (computational aspects) (68Q80)

Cited In (5)

• A search algorithm for subshift attractors of cellular automata
• \(\mu\)-limit sets of cellular automata from a computational complexity perspective
• Conservation of some dynamical properties for operations on cellular automata
• On the existence of maximal \(\omega \)-limit sets for dendrite maps
• Inferring the Limit Behavior of Some Elementary Cellular Automata

This page was built for publication: A Search Algorithm for the Maximal Attractor of a Cellular Automaton

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