关于R-平凡正则语言与J-平凡语言之逆的状态复杂性
On the State Complexity of the Reverse of R- and J-trivial Regular Languages
摘要:
状态复杂度n的R-平凡和J-平凡正则语言的逆的状态复杂度的紧上界是2^{n-1}。R-平凡正则语言的证明是三进制的,J-平凡正则语言的证明是(n-1)进制的。本文证明了在(n-2)元字母表上,二元R-平凡正则语言和二元J-平凡正则语言都不能满足该界.我们提供了一个严格的R-平凡的正则语言的边界取决于语言的状态复杂度和它的字母表的大小的表征。给出了n-2元字母表上J-平凡正则语言的紧界和二元J-平凡正则语言的几个紧界。(n-k)元字母表上的J-平凡正则语言(2 <= k <= n-3)的情形是开放的。
英文摘要:
The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages of the state complexity n is 2^{n-1}. The witness is ternary for R-trivial regular languages and (n-1)-ary for J-trivial regular languages. In this paper, we prove that the bound can be met neither by a binary R-trivial regular language nor by a J-trivial regular language over an (n-2)-element alphabet. We provide a characterization of tight bounds for R-trivial regular languages depending on the state complexity of the language and the size of its alphabet. We show the tight bound for J-trivial regular languages over an (n-2)-element alphabet and a few tight bounds for binary J-trivial regular languages. The case of J-trivial regular languages over an (n-k)-element alphabet, for 2 <= k <= n-3, is open.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。