The synchronization of nonuniform networks of finite automata
From MaRDI portal
Publication:1187031
DOI10.1016/0890-5401(92)90036-FzbMath0768.68003OpenAlexW2008135292MaRDI QIDQ1187031
Publication date: 28 June 1992
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(92)90036-f
Network design and communication in computer systems (68M10) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (4)
Revisiting the cutting of the firing squad synchronization ⋮ An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem ⋮ Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time \(D\lfloor \log_mD\rfloor\) ⋮ Nature-Based Problems in Cellular Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variations of the firing squad problem and applications
- Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
- Cellular automata synchronization
- The firing squad synchronization problem for a class of polyautomata networks
- On the minimal firing time of the firing squad synchronization problem for polyautomata networks
- An 8-state minimal time solution to the firing squad synchronization problem
- Two- and three-dimensional firing-squad synchronization problems
- Synchronization of cellular arrays: The firing squad problem in two dimensions
- The firing squad synchronization problem for two-dimensional arrays
- The parallelism principle: Speeding up the cellular automata synchronization
- A generalized firing squad problem
- Synchronization of interacting automata
This page was built for publication: The synchronization of nonuniform networks of finite automata
