2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/218926We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore's state minimization algorithm is in O(n log n). Moreover this bound is tight in the case of unary utomata.Data Structures and AlgorithmsComputational Complexitytext