Research articles

search articles

My Pages

Stat

Members: 3645
Articles: 2'504'928
Articles rated: 2609

26 April 2024

» arxiv » 0902.1048

Article overview

On the Average Complexity of Moore's State Minimization Algorithm
Frédérique Bassino ; Julien David ; Cyril Nicaud ;
Date:	6 Feb 2009
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.
Source:	arXiv, 0902.1048
Services:	Forum \| Review \| PDF \| Favorites

No review found.

Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)

ScienXe.org
» my Online CV
» Free

News, job offers and information for researchers and scientists:

home

contact

sitemap