On the Hopcroft's minimization algorithm
| dc.creator | Paun, Andrei | |
| dc.date | 2007-05-14 | |
| dc.date.accessioned | 2026-07-07T08:01:28Z | |
| dc.date.available | 2026-07-07T08:01:28Z | |
| dc.description | We show that the absolute worst case time complexity for Hopcroft's minimization algorithm applied to unary languages is reached only for de Bruijn words. A previous paper by Berstel and Carton gave the example of de Bruijn words as a language that requires O(n log n) steps by carefully choosing the splitting sets and processing these sets in a FIFO mode. 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. We also show that a LIFO implementation will not achieve the same worst time complexity for the case of unary languages. Lastly, we show that the same result is valid also for the cover automata and a modification of the Hopcroft's algorithm, modification used in minimization of cover automata. | |
| dc.description | 10 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/0705.1986 | |
| dc.identifier | http://arxiv.org/abs/0705.1986 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/128918 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | F.2.2; G.2.2 | |
| dc.title | On the Hopcroft's minimization algorithm | |
| dc.type | text |