Sciweavers

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

22

WIA
2004
Springer

favoriteEmaildiscussreport

142views Artificial Intelligence» more WIA 2004»

On the Complexity of Hopcroft's State Minimization Algorithm

13 years 9 months ago

On the Complexity of Hopcroft's State Minimization Algorithm

Download www-igm.univ-mlv.fr

Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a family of automata of size n = 2k on which the algorithm runs in time k2k . These automata have a very simple structure and are built over a one-letter alphabet. Their sets of ﬁnal states are deﬁned by de Bruijn words.

Jean Berstel, Olivier Carton

Real-time Traffic

Algorithm | Artificial Intelligence | Complexity Bound | Deterministic Automaton | WIA 2004 |

claim paper

Related Content

» On Extremal Cases of Hopcrofts Algorithm

» On the Average Complexity of Moores State Minimization Algorithm

» Minimizing Routing State for LightWeight Network Simulation

» Low Complexity Outage Optimal Distributed Channel Allocation for VehicletoVehicle Communic...

» A Parallel Algorithm for Minimization of Finite Automata

» Finding Lower Bounds for Nondeterministic State Complexity Is Hard

» Bisimulation Minimization of Tree Automata

» Efficient Timing Analysis Algorithms for Timed State Space Exploration

» Minimal dynamical structure realisations with application to network reconstruction from d...

Post Info
More Details (n/a)

Added	03 Jul 2010
Updated	03 Jul 2010
Type	Conference
Year	2004
Where	WIA
Authors	Jean Berstel, Olivier Carton

Comments (0)