An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays

MaRDI QIDQ4912168zbMATH OpenFDO

Authors Takuya Yamawaki, Kinuo Nishide, Hiroshi Umeo

Publication date 3 April 2013

zbMATH Keywords

cellular automatonfiring squad synchronizationtwo-dimensional rectangle synchronization

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
• A new time-optimum synchronization algorithm for rectangle arrays
• Unconventional Computation
• Synchronizing square arrays in optimum-time
• Two-dimensional cellular automata synchronizers

Cited in

(19)

• Synchronizing square arrays in optimum-time
• Time-optimum smaller-state synchronizers for cellular automata
• A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based
• Two-dimensional cellular automata synchronizers
• scientific article; zbMATH DE number 5117093 (Why is no real title available?)
• A new time-optimum synchronization algorithm for rectangle arrays
• scientific article; zbMATH DE number 2016494 (Why is no real title available?)
• Cutting the Firing Squad Synchronization
• An Investigation into Transition Rule Sets for Optimum-time Firing Squad Synchronization Algorithms on One-dimensional Cellular Automata
• A seven-state time-optimum square synchronizer
• A simple optimum-time FSSP algorithm for multi-dimensional cellular automata
• FSSP algorithms for 2D rectangular arrays. Recent developments
• An optimum-time square synchronization algorithm. One-sided recursive-halving marking based
• Unconventional Computation
• Machines, Computations, and Universality
• Developments in Language Theory
• On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
• scientific article; zbMATH DE number 7733663 (Why is no real title available?)
• A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays

This page was built for publication: An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays

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