Approximating the Minimum Length of Synchronizing Words Is Hard

Authors:
Mikhail V. Berlinkov
Affiliations:
Institute of Mathematics and Computer Science, Ural Federal University, Ekaterinburg, Russia 620000
Venue:
Theory of Computing Systems
Year:
2014

Citing 12
Cited 0

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
Complexity of problems concerning reset words for some partial cases of automata

Acta Cybernetica
The complexity of finding reset words in finite automata

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The NP-completeness of the Road Coloring Problem

Information Processing Letters
Approximating minimum reset sequences

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Approximating the minimum length of synchronizing words is hard

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Complexity of problems concerning carefully synchronizing words for PFA and directing words for NFA

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Complexity of problems concerning reset words for cyclic and Eulerian automata

Theoretical Computer Science
Synchronization of automata with one undefined or ambiguous transition

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that, unless P=NP, no polynomial-time algorithm can approximate the minimum length of reset words for a given synchronizing automaton within a constant factor.