2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/224890We 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.5 pages, 1 figure; some errors correctedComputational ComplexityFormal Languages and Automata TheoryF.1.1text