关于NP中一类约束同步问题
On a Class of Constrained Synchronization Problems in NP
摘要：
已知的约束自动机类，其约束同步问题是在NP都承认一个特殊的形式。在这项工作中，我们将仔细研究它们。我们刻画了一类更广泛的约束自动机，使约束同步问题的NP，其中包括所有已知的NP问题。我们称这些自动机为多环自动机。介绍了多环语言的相应语言类。我们展示了这个新的语言类的各种特征和封闭属性。然后给出了多环约束语言的NP完全性和多项式时间可解性的判别准则。
英文摘要：
The class of known constraint automata for which the constrained synchronization problem is in NP all admit a special form. In this work, we take a closer look at them. We characterize a wider class of constraint automata that give constrained synchronization problems in NP, which encompasses all known problems in NP. We call these automata polycyclic automata. The corresponding language class of polycyclic languages is introduced. We show various characterizations and closure properties for this new language class. We then give a criterion for NP-completeness and a criterion for polynomial time solvability for polycyclic constraint languages.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
