A tight linear bound on the synchronization delay of bijective automata
From MaRDI portal
Publication:2373732
DOI10.1016/j.tcs.2007.02.052zbMath1118.68090OpenAlexW2053540933WikidataQ29013339 ScholiaQ29013339MaRDI QIDQ2373732
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the bound of the synchronization delay of a local automaton
- Reversibility and surjectivity problems of cellular automata
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Developments in Language Theory
- The Theory of Definite Automata
- Endomorphisms and automorphisms of the shift dynamical system
- Automata, Languages and Programming