Cellular Automata Preimages: Count and List Algorithm

DOI10.1007/11758532_47zbMATH Open1157.68393OpenAlexW1535078242MaRDI QIDQ5503233FDOQ5503233

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• Computing the periods of preimages in surjective cellular automata
• The enumeration of preimages and gardens-of-Eden in sequential cellular automata
• Counting preimages of homogeneous configurations in 1-dimensional cellular automata
• Computation of explicit preimages in one-dimensional cellular automata applying the De Bruijn diagram
• Algorithms for computing preimages of cellular automata configurations
• Predecessors of cellular automata states. II: Pre-images of finite sequences
• Sequences of preimages in elementary cellular automata
• Title not available (Why is that?)

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)