Location of Repository

ON THE AVERAGE COMPLEXITY OF MOORE’S STATE MINIMIZATION ALGORITHM

By Frédérique Bassino, Julien David and Cyril Nicaud

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

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.190.4034
Provided by: CiteSeerX
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)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.