|
Abstract
|
|
|---|---|
| We show that the absolute worst case time complexity for Hopcroft¿s minimization algorithm applied to unary languages is reached only for deterministic automata or cover automata following the structure of the de Bruijn words. A previous paper by Berstel and Carton gave the example of de Bruijn words as a language that requires O(nlogn) steps in the case of deterministic automata by carefully choosing the splitting sets and processing these sets in a FIFO mode for the list of the splitting sets in the algorithm. We refine the previous result by showing that the Berstel/Carton example is actually the absolute worst case time complexity in the case of unary languages for deterministic automata. We show that the same result is valid also for the case of cover automata and an algorithm based on the Hopcroft¿s method used for minimization of cover automata. We also show that a LIFO implementation for the splitting list will not achieve the same absolute worst time complexity for the case of unary languages both in the case of regular deterministic finite automata or in the case of the deterministic finite cover automata as defined by S. Yu. | |
|
International
|
Si |
|
JCR
|
Si |
|
Title
|
THEORETICAL COMPUTER SCIENCE |
|
ISBN
|
0304-3975 |
|
Impact factor JCR
|
0,806 |
|
Impact info
|
|
|
Volume
|
410 |
|
|
http://dx.doi.org/10.1016/j.tcs.2009.02.034 |
|
Journal number
|
24 |
|
From page
|
2424 |
|
To page
|
2430 |
|
Month
|
MAYO |
|
Ranking
|
|