A simple optimum-time FSSP algorithm for multi-dimensional cellular automata

MaRDI QIDQ4986313zbMATHFDO

Authors Kinuo Nishide, Keisuke Kubo, Hiroshi Umeo

Publication date 27 April 2021

Full work available at URL https://arxiv.org/abs/1208.2761

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays
• An optimum-time square synchronization algorithm. One-sided recursive-halving marking based
• An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
• Unconventional Computation
• A new optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays: one-sided recursive halving based

Cited in

(8)

• scientific article; zbMATH DE number 7385088 (Why is no real title available?)
• A faster algorithm for the birthday song singers synchronization problem (FSSP) in one-dimensional CA with multiple speeds
• A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays
• A new reconstruction and the first implementation of Goto's FSSP algorithm
• Time-optimum smaller-state synchronizers for cellular automata
• Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays
• Smaller-state implementations of 2D FSSP algorithms. Recent developments
• An optimum-time square synchronization algorithm. One-sided recursive-halving marking based

This page was built for publication: A simple optimum-time FSSP algorithm for multi-dimensional cellular automata

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