Synchronization of cellular arrays: The firing squad problem in two dimensions

DOI10.1016/S0019-9958(75)90255-7MaRDI QIDQ4094803zbMATH OpenFDO

Authors A. Grasselli

Publication date 1975

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

Full work available at URL https://doi.org/10.1016/S0019-9958(75)90255-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(9)

• 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
• Complexity of perceptron recognition for a class of geometric patterns.
• Time-optimum smaller-state synchronizers for cellular automata
• The firing squad synchronization problem on CA with multiple updating cycles
• Generalized FSSP on hexagonal tiling: towards arbitrary regular spaces
• Revisiting the cutting of the firing squad synchronization

This page was built for publication: Synchronization of cellular arrays: The firing squad problem in two dimensions

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