The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Reset sequences for monotonic automata
SIAM Journal on Computing
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
Synchronizing Automata and the Černý Conjecture
Language and Automata Theory and Applications
Approximating the minimum length of synchronizing words is hard
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
The NP-completeness of the Road Coloring Problem
Information Processing Letters
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
Effective synchronizing algorithms
Expert Systems with Applications: An International Journal
Complexity of problems concerning reset words for cyclic and Eulerian automata
Theoretical Computer Science
Application of hierarchical classifier to minimal synchronizing word problem
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part I
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 study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP. This result answers a question posed by Volkov. For the search problems of finding a shortest reset word and the length of a shortest reset word, we establish membership in the complexity classes FPNP and FPNP[log], respectively. Moreover, we show that both these problems are hard for FPNP[log]. Finally, we observe that computing a reset word of a given length is FNP-complete.