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

DOI10.1016/S0304-3975(00)00244-9zbMath0974.68124OpenAlexW2052220583WikidataQ126400181 ScholiaQ126400181MaRDI QIDQ5941515

Bruno Martin

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00244-9

zbMATH Keywords

simulationcellular automataCayley graphs

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (1)

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

Cites Work

• A linear speed-up theorem for cellular automata
• A universal cellular automaton in quasi-linear time and its S-m-n form
• Embedding Torus Automata into a Ring of Automata
• Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simulation of cellular automata on hexagons by cellular automata on rings