L^2和L^k的状态复杂度
The state complexity of L^2 and L^k
摘要:
我们证明了,如果M是一个DFA,在任意字母表上有n个状态,并且L = L(M),那么L^2的最坏情况状态复杂度是n*2^n - 2^{n-1}。然而,如果M是一元字母表上的DFA,则对于所有k >= 2,L^k的最坏情况状态复杂度是kn-k+1。
英文摘要:
We show that if M is a DFA with n states over an arbitrary alphabet and L = L(M), then the worst-case state complexity of L^2 is n*2^n - 2^{n-1}. If, however, M is a DFA over a unary alphabet, then the worst-case state complexity of L^k is kn-k+1 for all k >= 2.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。