Cellular Automata Preimages: Count and List Algorithm

DOI10.1007/11758532_47MaRDI QIDQ5503233zbMATH OpenOpenAlexFDO

Authors Iztok Jeras, A. Dobnikar

Publication date 13 January 2009

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758532_47

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80)

Recommendations

• Algorithms for computing preimages of cellular automata configurations
• Counting preimages of homogeneous configurations in 1-dimensional cellular automata
• Predecessors of cellular automata states. II: Pre-images of finite sequences
• scientific article; zbMATH DE number 1142939
• scientific article; zbMATH DE number 4201650

Cited in

(9)

• Predecessors of cellular automata states. II: Pre-images of finite sequences
• Algorithms for computing preimages of cellular automata configurations
• Computation of explicit preimages in one-dimensional cellular automata applying the De Bruijn diagram
• Counting preimages of homogeneous configurations in 1-dimensional cellular automata
• scientific article; zbMATH DE number 4072384 (Why is no real title available?)
• The enumeration of preimages and gardens-of-Eden in sequential cellular automata
• Sequences of preimages in elementary cellular automata
• Computing the periods of preimages in surjective cellular automata
• Synchronization and control of cellular automata

This page was built for publication: Cellular Automata Preimages: Count and List Algorithm

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