Synchronizing square arrays in optimum-time

DOI10.1080/03081079.2012.695901zbMATH Open1277.68155OpenAlexW2152982141MaRDI QIDQ2869786FDOQ2869786

Authors Hiroshi Umeo

Publication date 6 January 2014

Published in International Journal of General Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081079.2012.695901

zbMATH Keywords

cellular automatonfiring squad synchronization problemcellular algorithmFSSP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)

Recommendations

• A new time-optimum synchronization algorithm for rectangle arrays
• An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
• Unconventional Computation
• Recent developments in constructing square synchronizers
• A seven-state time-optimum square synchronizer

Cites work

• A six-state minimal time solution to the Firing squad synchronization problem
• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• On optimal solutions to the firing squad synchronization problem
• THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
• Two- and three-dimensional firing-squad synchronization problems

Cited in

(13)

• Two-dimensional cellular automata synchronizers
• Characterization of nonlinear dynamic systems for engineering purposes – a partial review
• A new time-optimum synchronization algorithm for rectangle arrays
• A Comparative Study of Optimum-Time Synchronization Algorithms for One-Dimensional Cellular Automata – A Survey –
• Developments in Language Theory
• Time-optimum smaller-state synchronizers for cellular automata
• Recent developments in firing squad synchronization algorithms for two-dimensional cellular automata and their state-efficient implementations
• Recent developments in constructing square synchronizers
• Firing squad synchronization algorithms for two-dimensional cellular automata
• 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
• An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
• FSSP algorithms for 2D rectangular arrays. Recent developments

This page was built for publication: Synchronizing square arrays in optimum-time

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