排列的状态复杂性及其在字母模式约束下的决策问题
State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints
摘要:
我们调查的置换操作,或交换闭包,字母模式约束(APC)的状态复杂性。该类对应于Straubing-Th{é}rien层次的$3/2$级,包括有限语言、分段可测试语言或$\mathcal J$ -平凡语言、$\mathcal R$ -平凡语言和$\mathcal L$ -平凡语言。我们给出了一个尖锐的状态复杂性界表示在相关的有限语言的一元投影语言的最长字符串,这已经是尖锐的有限语言的子类。此外,对于两个子类,我们给出了明确的界限表示的识别输入自动机的大小和字母表的大小。最后,我们调查的包容性和普遍性问题的APC置换等价,两个问题被称为是PSPACE-完全的APC,即使是固定的字母表一般,并显示它们是可判定的多项式时间固定字母表在这种情况下。
英文摘要:
We investigate the state complexity of the permutation operation, or the commutative closure, on Alphabetical Pattern Constraints (APC). This class corresponds to level $3/2$ of the Straubing-Th{é}rien Hierarchy and includes the finite, the piecewise-testable, or $\mathcal J$-trivial, and the $\mathcal R$-trivial and $\mathcal L$-trivial languages. We give a sharp state complexity bound expressed in terms of the longest strings in the unary projection languages of an associated finite language and which is already sharp for the subclass of finite languages. Additionally, for two subclasses, we give sharp bounds expressed in terms of the size of a recognizing input automaton and the size of the alphabet. Lastly, we investigate the inclusion and universality problem on APCs up to permutational equivalence, two problems known to be PSPACE-complete on APCs even for fixed alphabets in general, and show them to be decidable in polynomial time for fixed alphabets in this case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。