The Complexity of Finding Reset Words in Finite Automata

被引：0
|
作者：
Olschewski, Jorg [1 ,2 ,3 ]
Ummels, Michael [2 ,3 ,4 ]
机构：
[1] Rhein Westfal TH Aachen Univ, Lehrstuhl Informat 7, Aachen, Germany
[2] CNRS, LSV, F-75700 Paris, France
[3] ENS, Cachan, France
[4] Rhein Westfal TH Aachen Univ, Math Grundlagen Informat, Aachen, Germany
来源：
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010 | 2010年 / 6281卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study several problems related to finding reset words in deterministic finite automata In particular, we establish that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP This result answers a question posed by Volkov For the search problems of finding a shortest reset word and the length of a shortest reset word, we establish membership in the complexity classes FPNP and FPNP[log], respectively Moreover, we show that both these problems are hard for FPNP[log] Finally, we observe that computing a reset word of a given length is FNP-complete
引用
收藏
页码：568 / +
页数：2
相关论文
共 50 条
12345