We 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(nlog n). Moreover this bound is tight in the case of unary automata
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.