Synchronization of cellular arrays: The firing squad problem in two dimensions
From MaRDI portal
Publication:4094803
DOI10.1016/S0019-9958(75)90255-7zbMath0328.94048MaRDI QIDQ4094803
Publication date: 1975
Published in: Information and Control (Search for Journal in Brave)
Related Items (9)
Complexity of perceptron recognition for a class of geometric patterns. ⋮ Time-Optimum Smaller-State Synchronizers for Cellular Automata ⋮ Revisiting the cutting of the firing squad synchronization ⋮ The firing squad synchronization problem on CA with multiple updating cycles ⋮ 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 ⋮ Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces
This page was built for publication: Synchronization of cellular arrays: The firing squad problem in two dimensions
