Decision Version of the Road Coloring Problem Is NP-Complete

被引：0
|
作者：
Roman, Adam [1 ]
机构：
[1] Jagiellonian Univ, Inst Comp Sci, Krakow, Poland
来源：
FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS | 2009年 / 5699卷
关键词：
AUTOMATA;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
After Trahtman in his brilliant paper [10] solved the Road Coloring Problem, a couple of new problems have arisen in the field of synchronizing automata. Some of them naturally extends questions related to the 'classical' version of synchronization. Particulary, it is known that the problem of finding the synchronizing word of a given length for a given automaton is NP-complete. Volkov [11] asked, what is the complexity of the following problem: given a constant out-degree digraph (possibly with multiple edges) and a natural number m, does there exist a synchronizing word of length in for some synchronizing labeling of G. In this paper we show that this decision version of the Road Coloring Problem is NP-complete.
引用
收藏
页码：287 / 297
页数：11
相关论文
共 50 条
  • [21] Timed protocol insecurity problem is NP-complete
    Benerecetti, Massimo
    Peron, Adriano
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2013, 29 (03): : 843 - 862
  • [22] The rectilinear Steiner arborescence problem is NP-complete
    Shi, WP
    Su, C
    SIAM JOURNAL ON COMPUTING, 2006, 35 (03) : 729 - 740
  • [23] Broadcasting with the least energy is an NP-complete problem
    Yang, Wuu
    Tseng, Huei-Ru
    Jan, Rong-Hong
    Shen, Bor-Yeh
    MUE: 2008 INTERNATIONAL CONFERENCE ON MULTIMEDIA AND UBIQUITOUS ENGINEERING, PROCEEDINGS, 2008, : 197 - 200
  • [24] A Weighted Version of the Jump Number Problem on Two-Dimensional Orders is NP-Complete
    Stéphan Ceroi
    Order, 2003, 20 : 1 - 11
  • [25] A weighted version of the jump number problem on two-dimensional orders is NP-complete
    Ceroi, S
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2003, 20 (01): : 1 - 11
  • [26] The Rectilinear Steiner Arborescence problem is NP-complete
    Shi, WP
    Su, C
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 780 - 787
  • [27] An NP-complete Problem for the Abelian Sandpile Model
    Schulz, Matthias
    COMPLEX SYSTEMS, 2007, 17 (01): : 17 - 28
  • [28] The 2-Attractor Problem Is NP-Complete
    Fuchs, Janosch
    Whittington, Philip
    41ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2024, 2024, 289
  • [29] THE SHORTEST COMMON NONSUBSEQUENCE PROBLEM IS NP-COMPLETE
    MIDDENDORF, M
    THEORETICAL COMPUTER SCIENCE, 1993, 108 (02) : 365 - 369
  • [30] NP-COMPLETE NUMBER-THEORETIC PROBLEM
    GURARI, EM
    IBARRA, OH
    JOURNAL OF THE ACM, 1979, 26 (03) : 567 - 581
12345