A design of generalized minimum-state-change FSSP algorithms and their implementations
From MaRDI portal
Publication:6062008
DOI10.1007/S11047-017-9625-2zbMATH Open1528.68245OpenAlexW2705807050MaRDI QIDQ6062008FDOQ6062008
Authors: Hiroshi Umeo, Keisuke Imai, A. Sousa 
Publication date: 30 November 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-017-9625-2
Recommendations
- A new reconstruction and the first implementation of Goto's FSSP algorithm
- How to synchronize cellular automata -- recent developments
- Smaller-state implementations of 2D FSSP algorithms. Recent developments
- State-efficient realization of fault-tolerant FSSP algorithms
- scientific article; zbMATH DE number 4072387
Cites Work
- Title not available (Why is that?)
- An 8-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 optimum solution to the firing squad synchronization problem
- A generalized firing squad problem
- Title not available (Why is that?)
- Some remarks about the efficiency of polyautomata
- A six-state minimal time solution to the Firing squad synchronization problem
- Title not available (Why is that?)
- An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
- A new reconstruction and the first implementation of Goto's FSSP algorithm
Cited In (1)
This page was built for publication: A design of generalized minimum-state-change FSSP algorithms and their implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062008)
