论文标题
在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.
