Synchronizing Words and Monoid Factorization - A Parameterized Perspective.
TAMC(2020)
摘要
The concept of a synchronizing word is a very important notion in the theory of finite automata. We consider the associated decision problem to decide if a given DFA possesses a synchronizing word of length at most k, where k is the standard parameter. We show that this problem DFA-SW is equivalent to the problem MONOID FACTORIZATION introduced by Cai, Chen, Downey and Fellows. Apart from the knownW[2]-hardness results, we show that these problems belong to A[2], W[P] and WNL. This indicates that DFA-SW is not complete for any of these classes and hence, we suggest a new parameterized complexity class W[Sync] as a proper home for these (and more) problems.
更多查看译文
关键词
Synchronizing word, Deterministic Finite Automaton (DFA), Parameterized complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络