ON THE AVERAGE COMPLEXITY OF MOORE’S STATE MINIMIZATION ALGORITHM

Abstract

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

Download PDF:
_{Sorry, we are unable to provide the full text but you may find it at the following location(s):}

http://citeseerx.ist.psu.edu/v... (external link)

http://drops.dagstuhl.de/opus/... (external link)