Approximating the minimum length of synchronizing words is hard

Autor:	Berlinkov, M. V.
Rok vydání:	2009
Předmět:	Computer Science - Formal Languages and Automata Theory Computer Science - Computational Complexity F.1.1 F.4.3
Druh dokumentu:	Working Paper
DOI:	10.1007/978-3-642-13182-0_4
Popis:	We prove that, unless $\mathrm{P}=\mathrm{NP}$, no polynomial algorithm can approximate the minimum length of \sws for a given \san within a constant factor. Comment: 12 pages, 1 figure
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/0909.3787 Zobrazit plný text záznamu View this record from Arxiv