A tight linear bound on the synchronization delay of bijective automata
From MaRDI portal
Publication:2373732
DOI10.1016/J.TCS.2007.02.052zbMATH Open1118.68090OpenAlexW2053540933WikidataQ29013339 ScholiaQ29013339MaRDI QIDQ2373732FDOQ2373732
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Endomorphisms and automorphisms of the shift dynamical system
- Reversibility and surjectivity problems of cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- On the bound of the synchronization delay of a local automaton
- Tesselations with local transformations
- Title not available (Why is that?)
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Title not available (Why is that?)
- Developments in Language Theory
- The Theory of Definite Automata
- Title not available (Why is that?)
- Automata, Languages and Programming
Cited In (4)
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)
