Firing squad synchronization algorithms for two-dimensional cellular automata
From MaRDI portal
Publication:3605708
zbMATH Open1173.68582MaRDI QIDQ3605708FDOQ3605708
Authors: Hiroshi Umeo 
Publication date: 24 February 2009
Recommendations
- Recent developments in firing squad synchronization algorithms for two-dimensional cellular automata and their state-efficient implementations
- Two-dimensional cellular automata synchronizers
- Synchronizing square arrays in optimum-time
- How to synchronize cellular automata -- recent developments
- Recent developments in constructing square synchronizers
Cited In (16)
- Time-optimum smaller-state synchronizers for cellular automata
- Computation of a determinant and a matrix product in cellular automata
- Recent developments in constructing square synchronizers
- Title not available (Why is that?)
- Leader election on two-dimensional periodic cellular automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to synchronize cellular automata -- recent developments
- Two-dimensional cellular automata synchronizers
- The firing squad synchronization problem on CA with multiple updating cycles
- Smaller-state implementations of 2D FSSP algorithms. Recent developments
- Problems on Two-Dimensional Synchronization Patterns
- Title not available (Why is that?)
- FSSP algorithms for 2D rectangular arrays. Recent developments
- Recent developments in firing squad synchronization algorithms for two-dimensional cellular automata and their state-efficient implementations
- A seven-state time-optimum square synchronizer
This page was built for publication: Firing squad synchronization algorithms for two-dimensional cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605708)
