How to synchronize cellular automata -- recent developments

DOI10.3233/FI-2020-1889MaRDI QIDQ5114233zbMATH OpenOpenAlexFDO

Authors Hiroshi Umeo

Publication date 21 June 2020

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2020-1889

zbMATH Keywords

cellular automatonfiring squad synchronization problemFSSP

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Recent developments in constructing square synchronizers
• Recent developments in firing squad synchronization algorithms for two-dimensional cellular automata and their state-efficient implementations
• Firing squad synchronization algorithms for two-dimensional cellular automata
• scientific article; zbMATH DE number 4072387
• FSSP algorithms for 2D rectangular arrays. Recent developments

Cited in

(25)

• The smallest FSSP partial solutions for one-dimensional ring cellular automata: symmetric and asymmetric synchronizers
• Smaller-state implementations of 2D FSSP algorithms. Recent developments
• A faster algorithm for the birthday song singers synchronization problem (FSSP) in one-dimensional CA with multiple speeds
• Error detection and correction in firing squad synchronization problem
• A new reconstruction and the first implementation of Goto's FSSP algorithm
• An adaptive algorithm for P system synchronization
• Time-optimum smaller-state synchronizers for cellular automata
• Firing squad synchronization algorithms for two-dimensional cellular automata
• scientific article; zbMATH DE number 4072387 (Why is no real title available?)
• scientific article; zbMATH DE number 1962858 (Why is no real title available?)
• scientific article; zbMATH DE number 2013815 (Why is no real title available?)
• scientific article; zbMATH DE number 2040823 (Why is no real title available?)
• Synchronization of cellular automaton pairs
• On the Synchronisation Problem over Cellular Automata
• Recent developments in constructing square synchronizers
• The firing squad synchronization problem on CA with multiple updating cycles
• An Investigation into Transition Rule Sets for Optimum-time Firing Squad Synchronization Algorithms on One-dimensional Cellular Automata
• FSSP algorithms for 2D rectangular arrays. Recent developments
• A Comparative Study of Optimum-Time Synchronization Algorithms for One-Dimensional Cellular Automata – A Survey –
• Remarks on the cellular automaton global synchronisation problem
• Recent developments in firing squad synchronization algorithms for two-dimensional cellular automata and their state-efficient implementations
• A design of generalized minimum-state-change FSSP algorithms and their implementations
• Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays
• State-efficient realization of fault-tolerant FSSP algorithms
• A class of the smallest 4-state FSSP partial solutions for rings -- a survey

This page was built for publication: How to synchronize cellular automata -- recent developments

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