Approximating the Minimum Length of Synchronizing Words Is Hard

被引：0

作者：

Berlinkov, Mikhail V. ^{[1
]}

机构：

[1] Ural State Univ, Dept Algebra & Discrete Math, Ekaterinburg 620083, Russia

来源：

COMPUTER SCIENCE - THEORY AND APPLICATIONS | 2010年 / 6072卷

关键词：

AUTOMATA; SEQUENCES;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：37 / 47

页数：11

共 50 条

[1] Approximating the Minimum Length of Synchronizing Words Is Hard
Berlinkov, Mikhail V.
[J]. THEORY OF COMPUTING SYSTEMS, 2014, 54 (02) : 211 - 223
[2] Approximating the Minimum Length of Synchronizing Words Is Hard
Mikhail V. Berlinkov
[J]. Theory of Computing Systems, 2014, 54 : 211 - 223
[3] Lower bound for the length of synchronizing words in partially-synchronizing automata
Roman, Adam
Forys, Wit
[J]. SOFSEM 2008: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2008, 4910 : 448 - 459
[4] A Lower Bound for the Length of the Shortest Carefully Synchronizing Words
Martyugin, P. V.
[J]. RUSSIAN MATHEMATICS, 2010, 54 (01) : 46 - 54
[5] Computing minimum length representations of sets of words of uniform length
Blanchet-Sadri, F.
Lohr, Andrew
[J]. THEORETICAL COMPUTER SCIENCE, 2015, 596 : 41 - 54
[6] Computing Minimum Length Representations of Sets of Words of Uniform Length
Blanchet-Sadri, Francine
Lohr, Andrew
[J]. COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 74 - 85
[7] Counting words of minimum length in an automorphic orbit
Lee, Donghi
[J]. JOURNAL OF ALGEBRA, 2006, 301 (01) : 35 - 58
[8] Clustering in Discrete Path Planning for Approximating Minimum Length Paths
Imeson, Frank
Smith, Stephen L.
[J]. 2017 AMERICAN CONTROL CONFERENCE (ACC), 2017, : 2968 - 2973
[9] APPROXIMATING MINIMUM-LENGTH-SEQUENCE METRICS - A CAUTIONARY NOTE
BOLAND, RP
BROWN, EK
DAY, WHE
[J]. MATHEMATICAL SOCIAL SCIENCES, 1983, 4 (03) : 261 - 270
[10] Synchronizing Relations on Words
Figueira, Diego
Libkin, Leonid
[J]. 31ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2014), 2014, 25 : 518 - 529

← 1 2 3 4 5 →