Two-dimensional cellular automata synchronizers
From MaRDI portal
Recommendations
- Firing squad synchronization algorithms for two-dimensional cellular automata
- Synchronizing square arrays in optimum-time
- An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
- Unconventional Computation
- Recent developments in firing squad synchronization algorithms for two-dimensional cellular automata and their state-efficient implementations
Cited in
(13)- A compositional approach to synchronize two-dimensional networks of processors
- Time-optimum smaller-state synchronizers for cellular automata
- Firing squad synchronization algorithms for two-dimensional cellular automata
- On fireflies, cellular systems, and evolware
- An efficient mapping scheme for embedding any one-dimensional firing squad synchronization algorithm onto two-dimensional arrays
- A comparative investigation into optimum-time synchronization protocols for a large scale of one-dimensional cellular automata
- Synchronization of cellular automaton pairs
- Firing squad synchronization problem on bidimensional cellular automata with communication constraints
- An optimum-time firing squad synchronization algorithm for two-dimensional rectangle arrays
- Several new generalized linear- and optimum-time synchronization algorithms for two-dimensional rectangular arrays
- Recent developments in firing squad synchronization algorithms for two-dimensional cellular automata and their state-efficient implementations
- Two-dimensional cellular automata
- Optimal and suboptimal regional control of probabilistic cellular automata
This page was built for publication: Two-dimensional cellular automata synchronizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3111786)