Complexity of a problem concerning reset words for Eulerian binary automata

被引：2
|
作者：
Vorel, Vojtech [1 ]
机构：
[1] Charles Univ Prague, Fac Math & Phys, Malostranske Nam 25, Prague 11800, Malaysia
来源：
INFORMATION AND COMPUTATION | 2017年 / 253卷
关键词：
CERNY CONJECTURE;
D O I：
10.1016/j.ic.2016.06.013
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A word is called a reset word for a deterministic finite automaton if it maps all the states of the automaton to a unique state. Deciding about the existence of a reset word of a given length for a given automaton is known to be an NP-complete problem. We prove that it remains NP-complete even if restricted to Eulerian automata with binary alphabets as it has been conjectured by Martyugin (2011). (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码：497 / 509
页数：13
相关论文
共 50 条
  • [31] The subword complexity of a class of infinite binary words
    Gheorghiciuc, Irina
    ADVANCES IN APPLIED MATHEMATICS, 2007, 39 (02) : 237 - 259
  • [32] A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
    Rodaro, Emanuele
    JOURNAL OF ALGEBRAIC COMBINATORICS, 2019, 50 (03) : 237 - 253
  • [33] Complexity of infinite words generated by countable q-automata
    Le Gonidec, Marion
    ANNALES DE L INSTITUT FOURIER, 2006, 56 (07) : 2463 - 2491
  • [34] Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA
    Martyugin, P. V.
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2010, 6072 : 288 - 302
  • [35] On a problem of Steinhaus concerning binary sequences
    Eliahou, S
    Hachez, D
    EXPERIMENTAL MATHEMATICS, 2004, 13 (02) : 215 - 229
  • [36] On the complexity of the Eulerian closed walk with precedence path constraints problem
    Kerivin, H. L. M.
    Lacroix, M.
    Mahjoub, A. R.
    THEORETICAL COMPUTER SCIENCE, 2012, 439 : 16 - 29
  • [37] Computing abelian complexity of binary uniform morphic words
    Blanchet-Sadri, F.
    Seita, Daniel
    Wise, David
    THEORETICAL COMPUTER SCIENCE, 2016, 640 : 41 - 51
  • [38] Computational Complexity of the Stability Problem for Elementary Cellular Automata
    Goles, Eric
    Lobos, Fabiola
    Montealegre, Pedro
    Ruivo, Eurico L. P.
    de Oliveira, Pedro P. B.
    JOURNAL OF CELLULAR AUTOMATA, 2020, 15 (04) : 261 - 304
  • [39] Eulerian paths and a problem concerning n-arc connected spaces
    Fedeli, Alessandro
    Le Donne, Attilio
    TOPOLOGY AND ITS APPLICATIONS, 2014, 161 : 159 - 162
  • [40] Learning cellular automata rules for binary classification problem
    Anna Piwonska
    Franciszek Seredynski
    Miroslaw Szaban
    The Journal of Supercomputing, 2013, 63 : 800 - 815
12345