Reset sequences for monotonic automata
SIAM Journal on Computing
Composition sequences for functions over a finite domain
Theoretical Computer Science
Synchronizing finite automata on Eulerian digraphs
Theoretical Computer Science - Mathematical foundations of computer science
Synchronizing monotonic automata
Theoretical Computer Science - Developments in language theory
Synchronizing automata preserving a chain of partial orders
Theoretical Computer Science
The complexity of finding reset words in finite automata
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Approximating the minimum length of synchronizing words is hard
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Approximating the Minimum Length of Synchronizing Words Is Hard
Theory of Computing Systems
| Hi-index | 5.23 |
A word is called a reset word for a deterministic finite automaton if it maps all states of this automaton to one state. We consider two classes of automata: cyclic automata and Eulerian automata. For these classes we study the computational complexity of the following problems: does there exist a reset word of given length for a given automaton? what is the minimal length of the reset words for a given automaton?