Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

STACS
2009
Springer

favoriteEmaildiscussreport

115views Theoretical Computer Science» more STACS 2009»

On the Average Complexity of Moore's State Minimization Algorithm

13 years 11 months ago

On the Average Complexity of Moore's State Minimization Algorithm

Download hal.archives-ouvertes.fr

Abstract. We prove that, for any arbitrary ﬁnite 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 automata.

Frédérique Bassino, Julien David, Cy

Real-time Traffic

Accessible Automata | Arbitrary ﬁnite Alphabet | Moore’s State Minimization | STACS 2009 | Theoretical Computer Science |

claim paper

Related Content

» BoyerMoore String Matching over ZivLempel Compressed Text

» A Risk Minimization Principle for a Class of Parzen Estimators

» On the Complexity of Hopcrofts State Minimization Algorithm

» A more bioplausible approach to the evolutionary inference of finite state machines

» Complexity of Probabilistic Planning under Average Rewards

» Minimizing Routing State for LightWeight Network Simulation

» On the Theory of Average Case Complexity

» Distributed averaging on digital erasure networks

» A DecompositionBased LowComplexity Scheduling Scheme for Power Minimization under Delay Co...

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	STACS
Authors	Frédérique Bassino, Julien David, Cyril Nicaud

Comments (0)