A single-copy minimal-time simulation of a torus of automata by a ring of automata

DOI10.1016/J.DAM.2007.05.019MaRDI QIDQ2384397zbMATH OpenOpenAlexFDO

Authors Bruno Martin, Claudine Peyrat

Publication date 21 September 2007

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.05.019

zbMATH Keywords

complexityCayley graphsCellular automata

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Cellular automata (computational aspects) (68Q80)

Recommendations

• Embedding Torus Automata into a Ring of Automata
• A simulation of cellular automata on hexagons by cellular automata on rings
• Simulations between cellular automata on Cayley graphs
• Simulations between cellular automata on Cayley graphs
• scientific article; zbMATH DE number 522866

Cites work

• scientific article; zbMATH DE number 522866 (Why is no real title available?)
• scientific article; zbMATH DE number 194711 (Why is no real title available?)
• scientific article; zbMATH DE number 816973 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• scientific article; zbMATH DE number 3379174 (Why is no real title available?)
• A linear speed-up theorem for cellular automata
• A simulation of cellular automata on hexagons by cellular automata on rings
• A six-state minimal time solution to the Firing squad synchronization problem
• A universal cellular automaton in quasi-linear time and its S-m-n form
• Amenable groups and cellular automata
• Complexity and decidability
• Embedding Torus Automata into a Ring of Automata
• Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
• Reversible simulation of one-dimensional irreversible cellular automata
• Simple 8-state minimal time solution to the firing squad synchronization problem
• The firing squad synchronization problem on Cayley graphs

Cited in

(1)

• A simulation of cellular automata on hexagons by cellular automata on rings

This page was built for publication: A single-copy minimal-time simulation of a torus of automata by a ring of automata

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