Document Open Access Logo

On the Average Complexity of Moore's State Minimization Algorithm

Authors Frederique Bassino, Julien David, Cyril Nicaud



PDF
Thumbnail PDF

File

LIPIcs.STACS.2009.1822.pdf
  • Filesize: 199 kB
  • 12 pages

Document Identifiers

Author Details

Frederique Bassino
Julien David
Cyril Nicaud

Cite AsGet BibTex

Frederique Bassino, Julien David, and Cyril Nicaud. On the Average Complexity of Moore's State Minimization Algorithm. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 123-134, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/LIPIcs.STACS.2009.1822

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 $\mathcal{O}(n \log n)$. Moreover this bound is tight in the case of unary automata.
Keywords
  • Finite automata
  • State minimization
  • Moore’s algorithm
  • Average complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail