A 4-states algebraic solution to linear cellular automata synchronization
From MaRDI portal
Publication:963403
DOI10.1016/j.ipl.2008.01.009zbMath1186.68311OpenAlexW2006125621MaRDI QIDQ963403
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.01.009
Related Items
Time-Optimum Smaller-State Synchronizers for Cellular Automata ⋮ About 4-States Solutions to the Firing Squad Synchronization Problem ⋮ The minimum firing time of the generalized firing squad synchronization problem for squares ⋮ A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic properties of cellular automata
- A six-state minimal time solution to the Firing squad synchronization problem
- Cellular automata, Pascal's triangle, and generation of order
- Seven-state solutions to the firing squad synchronization problem
- Smaller solutions for the firing squad
- An 8-state minimal time solution to the firing squad synchronization problem
- An optimum solution to the firing squad synchronization problem
- An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
- A Design of Symmetrical Six-State 3n-Step Firing Squad Synchronization Algorithms and Their Implementations
- About 4-States Solutions to the Firing Squad Synchronization Problem
- A Smallest Five-State Solution to the Firing Squad Synchronization Problem
- Superposable Trellis Automata
- Linear cellular automata and recurring sequences in finite fields
This page was built for publication: A 4-states algebraic solution to linear cellular automata synchronization
