Leader election on two-dimensional periodic cellular automata

DOI10.1016/j.tcs.2016.10.021zbMath1358.68207OpenAlexW2553612887MaRDI QIDQ729998

Nicolas Bacquey

Publication date: 23 December 2016

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.10.021

zbMATH Keywords

cellular automataequivalence classesleader electionbi-periodical configurationuniform computation

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Unnamed Item
• Unnamed Item
• A six-state minimal time solution to the Firing squad synchronization problem
• On translating one polyomino to tile the plane
• Signals in one-dimensional cellular automata
• Theory of cellular automata: a survey
• Computations on one-dimensional cellular automata
• Algorithms for Leader Election by Cellular Automata
• An 8-state minimal time solution to the firing squad synchronization problem
• Complexity classes on spatially periodic Cellular Automata
• Proving theorems by pattern recognition I

This page was built for publication: Leader election on two-dimensional periodic cellular automata