On the Average Complexity of Moore's State Minimization Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Year : 2009

On the Average Complexity of Moore's State Minimization Algorithm

Julien David
  • Function : Author
  • PersonId : 857843
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(n log n). Moreover this bound is tight in the case of unary utomata.
Fichier principal
Vignette du fichier
bassino_new.pdf (252.49 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00359162 , version 1 (06-02-2009)

Identifiers

  • HAL Id : inria-00359162 , version 1
  • ARXIV : 0902.1048

Cite

Frédérique Bassino, Julien David, Cyril Nicaud. On the Average Complexity of Moore's State Minimization Algorithm. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.123-134. ⟨inria-00359162⟩
202 View
233 Download

Altmetric

Share

More