Linear speed-up for cellular automata synchronizers and applications
From MaRDI portal
Publication:1389648
DOI10.1016/S0304-3975(96)00211-3zbMath0893.68106MaRDI QIDQ1389648
Publication date: 30 June 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On real-time cellular automata and trellis automata
- A linear speed-up theorem for cellular automata
- Seven-state solutions to the firing squad synchronization problem
- An 8-state minimal time solution to the firing squad synchronization problem
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
This page was built for publication: Linear speed-up for cellular automata synchronizers and applications
