A generalized firing squad problem

DOI10.1016/S0019-9958(68)90309-4MaRDI QIDQ5538924zbMATH OpenFDO

Authors Frank R. Moore, Glen G. Jun. Langdon

Publication date 1968

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(68)90309-4

zbMATH Keywords

mathematical logic

Cited in

(30)

• Network structure and the firing squad synchronization problem
• Variations of the firing squad problem and applications
• The firing squad synchronization problem for graphs
• Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
• An efficient solution of the firing mob problem
• The synchronization of nonuniform networks of finite automata
• Cellular automata synchronization
• On the fast synchronization of tree connected networks
• (A-)synchronous (non)-deterministic cell spaces simulating each other
• Seven-state solutions to the firing squad synchronization problem
• On optimal solutions to the firing squad synchronization problem
• Smaller solutions for the firing squad
• Error detection and correction in firing squad synchronization problem
• The minimum firing time of the generalized firing squad synchronization problem for squares
• The firing squad problem revisited
• A new reconstruction and the first implementation of Goto's FSSP algorithm
• Real-time language recognition by one-dimensional cellular automata
• An adaptive algorithm for P system synchronization
• Minimum and non-minimum time solutions to the firing squad synchronization problem
• Time-optimum smaller-state synchronizers for cellular automata
• The firing squad problem revisited
• The firing squad synchronization problem on CA with multiple updating cycles
• Constant space self-stabilizing center finding algorithms in chains and trees
• FSSP algorithms for 2D rectangular arrays. Recent developments
• Generalized FSSP on hexagonal tiling: towards arbitrary regular spaces
• The firing squad synchronization problem on Cayley graphs
• Bounding the firing synchronization problem on a ring
• A design of generalized minimum-state-change FSSP algorithms and their implementations
• Revisiting the cutting of the firing squad synchronization
• Essential metrics for life on graphs

This page was built for publication: A generalized firing squad problem

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