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(n log n). Moreover this bound is tight in the case of unary automata.

• Type: Conference
• Year: 2009
• Where: STACS
• Authors: Frédérique Bassino, Julien David, Cyril Nicaud
• Keywords: Accessible Automata, Arbitrary finite Alphabet, Moore’s State Minimization, STACS 2009, Theoretical Computer Science