arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.10355cs.FL
收藏

子字闭语言的状态复杂度研究

On state complexity for subword-closed languages

Jérôme Guyot

AI总结:

本文研究子字闭、超字闭语言的状态复杂度,证明了超字闭语言k次方根、一般替换的指数下界,以及子字闭语言特定平方根问题、满足特定条件替换的二次上下界。

摘要:

本文研究子字闭语言与超字闭语言的状态复杂度,并将其与正则语言进行对比,聚焦平方根算子与替换算子。我们证明了超字闭语言k次方根的指数下界;针对子字闭语言,详细分析了平方根问题的一个具体实例,证明其具有二次复杂度。对于替换算子,我们给出了一般替换的指数下界,随后找到了若干可证明二次上界的条件。

英文摘要:

This paper investigates the state complexities of subword-closed and superword-closed languages, comparing them to regular languages. We focus on the square root operator and the substitution operator. We establish an exponential lower bound for superword-closed languages for the k-th root. For subword-closed languages we analyze in detail a specific instance of the square root problem for which a quadratic complexity is proven. For the substitution operator, we show an exponential lower bound for the general substitution. We then find some conditions for which we prove a quadratic upper bound.

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

↑