The state complexity of L2 and Lk
Abstract
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 L2 is n*2n - 2n-1. If, however, M is a DFA over a unary alphabet, then the worst-case state complexity of Lk is kn-k+1 for all k >= 2.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.