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 条
12345