arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.07728cs.FLcs.DS
收藏

正则语言的动态成员关系

Dynamic Membership for Regular Languages

Antoine Amarilli, Louis Jachiet, Charles Paperman

摘要:

我们研究了正则语言的动态成员问题:固定一个语言L,读取一个单词w,在时间O(|w|)内建立一个数据结构,指示w是否在L中,并在w上的字母替换下有效地维护这个结构。我们考虑这个问题的单位成本的RAM模型与对数字长,其中的问题总是有一个解决方案在O(log |w| / log log |w|)每操作。我们表明,这个问题是在O(日志日志|w|)的语言在代数定义的,可判定类QSG,它是在O(1)的另一个这样的类QLZG。我们表明,语言不QSG承认减少从前缀问题的循环群,使他们需要Ω(log |w| / log log |w|)操作在最坏的情况下,和QSG语言不QLZG承认减少从前缀问题的乘法幺半群U 1 = {0,1},我们猜想不能保持在O(1)。这就产生了一个有条件的可分性。我们还研究了O(1)和O(log log |w|)之间的中间情况。我们的结果通过么半群和半群的动力字问题给出,并给出了它们的分类。因此,我们解决了Skovbjerg Frandsen,Miltersen和Skyum [30]关于动态词问题的论文中的开放问题,并另外涵盖了正则语言。

英文摘要:

We study the dynamic membership problem for regular languages: fix a language L, read a word w, build in time O(|w|) a data structure indicating if w is in L, and maintain this structure efficiently under letter substitutions on w. We consider this problem on the unit cost RAM model with logarithmic word length, where the problem always has a solution in O(log |w| / log log |w|) per operation. We show that the problem is in O(log log |w|) for languages in an algebraically-defined, decidable class QSG, and that it is in O(1) for another such class QLZG. We show that languages not in QSG admit a reduction from the prefix problem for a cyclic group, so that they require Ω(log |w| / log log |w|) operations in the worst case; and that QSG languages not in QLZG admit a reduction from the prefix problem for the multiplicative monoid U 1 = {0, 1}, which we conjecture cannot be maintained in O(1). This yields a conditional trichotomy. We also investigate intermediate cases between O(1) and O(log log |w|). Our results are shown via the dynamic word problem for monoids and semigroups, for which we also give a classification. We thus solve open problems of the paper of Skovbjerg Frandsen, Miltersen, and Skyum [30] on the dynamic word problem, and additionally cover regular languages.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑