On the Average Complexity of Moore's State Minimization Algorithm
Data Structures and Algorithms
2009-02-09 v1 Computational Complexity
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 utomata.
Keywords
Cite
@article{arxiv.0902.1048,
title = {On the Average Complexity of Moore's State Minimization Algorithm},
author = {Frédérique Bassino and Julien David and Cyril Nicaud},
journal= {arXiv preprint arXiv:0902.1048},
year = {2009}
}