Synchronizing monotonic automata
From MaRDI portal
Publication:703567
DOI10.1016/J.TCS.2004.03.068zbMATH Open1160.68398OpenAlexW1502758008MaRDI QIDQ703567FDOQ703567
Authors: D. S. Ananichev, M. V. Volkov
Publication date: 11 January 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.068
Interval rank of a wordMonotonic automataOrder preserving transformationRank of a wordSynchronizing automata
Cites Work
Cited In (15)
- Groups synchronizing a transformation of non-uniform kernel
- The annulation threshold for partially monotonic automata
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- The relation between preset distinguishing sequences and synchronizing sequences
- Synchronizing finite automata with short reset words
- Constrained synchronization for monotonic and solvable automata and automata with simple idempotents
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
- 2-Synchronizing Words
- Extremal synchronizing circular automata
- Synchronizing generalized monotonic automata
- Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- COMPAS -- a computing package for synchronization
- Synchronizing sequences for road colored digraphs
- A series of slowly synchronizing automata with a zero state over a small alphabet
This page was built for publication: Synchronizing monotonic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703567)