Approximating the minimum length of synchronizing words is hard
Formal Languages and Automata Theory
2015-05-14 v2 Computational Complexity
Abstract
We prove that, unless , no polynomial algorithm can approximate the minimum length of \sws for a given \san within a constant factor.
Keywords
Cite
@article{arxiv.0909.3787,
title = {Approximating the minimum length of synchronizing words is hard},
author = {M. V. Berlinkov},
journal= {arXiv preprint arXiv:0909.3787},
year = {2015}
}
Comments
12 pages, 1 figure