无星语言的商复杂度
Quotient Complexity of Star-Free Languages
摘要:
正则语言的商复杂度,也称为状态复杂度,是该语言的不同左序的数量。一个运算的商复杂度是由该运算产生的语言的最大商复杂度,作为操作数的商复杂度的函数。无星语言类是包含有限语言的最小类,在布尔运算和连接下是封闭的。我们证明了无星语言的并、交、差、对称差、连接和星的商复杂度的紧界与正则语言的商复杂度的紧界是相同的,只有一些小的例外,而反转的商复杂度的紧界是2^n-1。
英文摘要:
The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the language resulting from the operation, as a function of the quotient complexities of the operands. The class of star-free languages is the smallest class containing the finite languages and closed under boolean operations and concatenation. We prove that the tight bounds on the quotient complexities of union, intersection, difference, symmetric difference, concatenation, and star for star-free languages are the same as those for regular languages, with some small exceptions, whereas the bound for reversal is 2^n-1.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。