Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces

DOI10.1007/978-3-319-18812-6_7zbMath1432.68284OpenAlexW2229386859MaRDI QIDQ5501615

Jean-Baptiste Yunès, Luidnel Maignan

Publication date: 4 August 2015

Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18812-6_7

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A six-state minimal time solution to the Firing squad synchronization problem
• Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
• Cellular automata synchronization
• Smaller solutions for the firing squad
• Simple 8-state minimal time solution to the firing squad synchronization problem
• An 8-state minimal time solution to the firing squad synchronization problem
• Two- and three-dimensional firing-squad synchronization problems
• Synchronization of cellular arrays: The firing squad problem in two dimensions
• The firing squad synchronization problem for two-dimensional arrays
• A Spatio-temporal Algorithmic Point of View on Firing Squad Synchronisation Problem
• A generalized firing squad problem
• The firing squad synchronization problem on Cayley graphs

This page was built for publication: Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces