A 4-states algebraic solution to linear cellular automata synchronization
From MaRDI portal
Publication:963403
DOI10.1016/J.IPL.2008.01.009zbMATH Open1186.68311OpenAlexW2006125621MaRDI QIDQ963403FDOQ963403
Authors: Jean-Baptiste Yunès 
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
Recommendations
- On the Synchronisation Problem over Cellular Automata
- About 4-States Solutions to the Firing Squad Synchronization Problem
- Linear speed-up for cellular automata synchronizers and applications
- Time-optimum smaller-state synchronizers for cellular automata
- Fault tolerant solutions to the firing squad synchronization problem in linear cellular automata
- Synchronizing random automata on a 4-letter alphabet
- An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
- scientific article; zbMATH DE number 2013815
- Synchronization of cellular automaton pairs
- Remarks on the cellular automaton global synchronisation problem
Cites Work
- Title not available (Why is that?)
- Algebraic properties of cellular automata
- An 8-state minimal time solution to the firing squad synchronization problem
- An optimum solution to the firing squad synchronization problem
- Title not available (Why is that?)
- Linear cellular automata and recurring sequences in finite fields
- A six-state minimal time solution to the Firing squad synchronization problem
- Smaller solutions for the firing squad
- Seven-state solutions to the firing squad synchronization problem
- Cellular automata, Pascal's triangle, and generation of order
- Title not available (Why is that?)
- 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
Cited In (4)
- Time-optimum smaller-state synchronizers for cellular automata
- 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\)
- About 4-States Solutions to the Firing Squad Synchronization Problem
This page was built for publication: A 4-states algebraic solution to linear cellular automata synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963403)
