Cellular automata synchronization

DOI10.1016/S0020-0255(76)90938-5zbMath0334.94017OpenAlexW2091618015MaRDI QIDQ1229190

Francesco Romani

Publication date: 1976

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(76)90938-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

The firing squad synchronization problem for graphs ⋮ An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem ⋮ Unnamed Item ⋮ An efficient solution of the firing mob problem ⋮ The synchronization of nonuniform networks of finite automata ⋮ On the fast synchronization of tree connected networks ⋮ The firing squad synchronization problem for a class of polyautomata networks ⋮ (A-)synchronous (non)-deterministic cell spaces simulating each other ⋮ On the minimal firing time of the firing squad synchronization problem for polyautomata networks ⋮ Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces ⋮ Network structure and the firing squad synchronization problem

Cites Work

• Unnamed Item
• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• Two- and three-dimensional firing-squad synchronization problems
• Synchronization of growing cellular arrays
• Synchronization of cellular arrays: The firing squad problem in two dimensions
• A generalized firing squad problem
• Synchronization of interacting automata
• Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation

This page was built for publication: Cellular automata synchronization