A 4-states algebraic solution to linear cellular automata synchronization

DOI10.1016/J.IPL.2008.01.009MaRDI QIDQ963403zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cellular automatasynchronizationparallel algorithmstheory of computationfiring squad

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

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

• scientific article; zbMATH DE number 4211531 (Why is no real title available?)
• scientific article; zbMATH DE number 3305051 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A Design of Symmetrical Six-State 3n-Step Firing Squad Synchronization Algorithms and Their Implementations
• A Smallest Five-State Solution to the Firing Squad Synchronization Problem
• A six-state minimal time solution to the Firing squad synchronization problem
• About 4-States Solutions to the Firing Squad Synchronization Problem
• Algebraic properties of cellular automata
• An 8-state minimal time solution to the firing squad synchronization problem
• An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• Cellular automata, Pascal's triangle, and generation of order
• Linear cellular automata and recurring sequences in finite fields
• Seven-state solutions to the firing squad synchronization problem
• Smaller solutions for the firing squad
• Superposable trellis automata

Cited in

(4)

• A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\)
• The minimum firing time of the generalized firing squad synchronization problem for squares
• Time-optimum smaller-state synchronizers for cellular automata
• 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)