Reset sequences for monotonic automata
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Composition sequences for functions over a finite domain
Theoretical Computer Science
Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
The complexity of finding reset words in finite automata
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Complexity of problems concerning reset words for cyclic and Eulerian automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Experimental study of the shortest reset word of random automat
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Complexity of problems concerning reset words for cyclic and Eulerian automata
Theoretical Computer Science
The Synchronizing Probability Function of an Automaton
SIAM Journal on Discrete Mathematics
Generating small automata and the Černý conjecture
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Approximating the Minimum Length of Synchronizing Words Is Hard
Theory of Computing Systems
| Hi-index | 0.00 |
We prove that, unless P=NP, no polynomial-time algorithm can approximate the minimum length of synchronizing words for a given synchronizing automaton within a constant factor.