A Seven-State Time-Optimum Square Synchronizer

DOI10.1007/978-3-642-15979-4_24zbMath1306.68116OpenAlexW35349092MaRDI QIDQ4931212

Keisuke Kubo, Hiroshi Umeo

Publication date: 4 October 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15979-4_24

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (4)

Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem ⋮ Time-Optimum Smaller-State Synchronizers for Cellular Automata ⋮ FSSP Algorithms for 2D Rectangular Arrays. Recent Developments ⋮ Error detection and correction in firing squad synchronization problem

Cites Work

• 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
• An 8-state minimal time solution to the firing squad synchronization problem
• Two- and three-dimensional firing-squad synchronization problems
• Unconventional Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Seven-State Time-Optimum Square Synchronizer