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

正则语言原子的商复杂度

Quotient Complexities of Atoms of Regular Languages

Janusz Brzozowski, Hellis Tamm

摘要:

具有n个(左)子元的正则语言L的原子是L的未补子元或补子元的非空交集,其中n个子元中的每一个出现在交集的项中。L的商复杂度,与L的状态复杂度相同,是L的商的个数。本文证明了:对于商复杂度为n的任意语言L,当r=0或r=n时,L中任意原子与r个补元的商复杂度的上界为2^n-1,否则为1+ \sum_{k=1}^{r} \sum_{h=k+1}^{k+n-r} C_{h} ^{n} \cdot C_{k} ^{h},其中C_j^i为二项式系数.对于每个n \ge 1,我们展示了一种语言,其原子满足这些界限。

英文摘要:

An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection. The quotient complexity of L, which is the same as the state complexity of L, is the number of quotients of L. We prove that, for any language L with quotient complexity n, the quotient complexity of any atom of L with r complemented quotients has an upper bound of 2^n-1 if r=0 or r=n, and 1+\sum_{k=1}^{r} \sum_{h=k+1}^{k+n-r} C_{h}^{n} \cdot C_{k}^{h} otherwise, where C_j^i is the binomial coefficient. For each n\ge 1, we exhibit a language whose atoms meet these bounds.

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

↑