Cellular automata synchronization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3419059 (Why is no real title available?)
- A generalized firing squad problem
- An 8-state minimal time solution to the firing squad synchronization problem
- An optimum solution to the firing squad synchronization problem
- Models for cellular interactions in development without polarity of individual cells II. Problems of synchronization and regulation
- Synchronization of cellular arrays: The firing squad problem in two dimensions
- Synchronization of growing cellular arrays
- Synchronization of interacting automata
- Two- and three-dimensional firing-squad synchronization problems
Cited in
(11)- Generalized FSSP on hexagonal tiling: towards arbitrary regular spaces
- On the fast synchronization of tree connected networks
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- The firing squad synchronization problem for graphs
- On the minimal firing time of the firing squad synchronization problem for polyautomata networks
- The firing squad synchronization problem for a class of polyautomata networks
- An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
- An efficient solution of the firing mob problem
- The synchronization of nonuniform networks of finite automata
- scientific article; zbMATH DE number 3742629 (Why is no real title available?)
- Network structure and the firing squad synchronization problem
This page was built for publication: Cellular automata synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1229190)