A tight linear bound on the synchronization delay of bijective automata

DOI10.1016/J.TCS.2007.02.052MaRDI QIDQ2373732zbMATH OpenOpenAlexWikidataFDO

Authors Eugen Czeizler, Jarkko Kari

Publication date 16 July 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.02.052

zbMATH Keywords

local automatareversible cellular automatasynchronization delayinverse neighborhood

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Deterministic synchronization of automata with bounded delay
• On the bound of the synchronization delay of a local automaton
• Synchronizing automata of bounded rank
• A QUASI-OPTIMAL TIME FOR SYNCHRONIZING TWO INTERACTING FINITE AUTOMATA
• Synchronizing delay for binary uniform morphisms
• Synchronizing Automata and the Černý Conjecture
• An improvement to a recent upper bound for synchronizing words of finite automata
• Synchronizing times for \(k\)-sets in automata
• Synchronizing Automata with Extremal Properties
• The Synchronization Problem for Strongly Transitive Automata

Cites work

• scientific article; zbMATH DE number 1818513 (Why is no real title available?)
• scientific article; zbMATH DE number 21231 (Why is no real title available?)
• scientific article; zbMATH DE number 176951 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3205673 (Why is no real title available?)
• Automata, Languages and Programming
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Developments in Language Theory
• Endomorphisms and automorphisms of the shift dynamical system
• On the bound of the synchronization delay of a local automaton
• Reversibility and surjectivity problems of cellular automata
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• Tesselations with local transformations
• The Theory of Definite Automata

Cited in

(4)

• Synchronizing delay for binary uniform morphisms
• Deterministic synchronization of automata with bounded delay
• The group of reversible Turing machines
• A QUASI-OPTIMAL TIME FOR SYNCHRONIZING TWO INTERACTING FINITE AUTOMATA

This page was built for publication: A tight linear bound on the synchronization delay of bijective automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373732)