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

zbMATH Open1460.68069arXiv1208.2761MaRDI QIDQ4986313FDOQ4986313

Authors: Kinuo Nishide, Keisuke Kubo, Hiroshi Umeo 

Publication date: 27 April 2021

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

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

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cited In (8)

• Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays
• Time-optimum smaller-state synchronizers for cellular automata
• An optimum-time square synchronization algorithm. One-sided recursive-halving marking based
• Title not available (Why is that?)
• 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
• Smaller-state implementations of 2D FSSP algorithms. Recent developments
• A new reconstruction and the first implementation of Goto's FSSP algorithm

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)