2 citations · 4 across the 5 of their papers we have counts for
1 paper · 1 filter
Andrei Paun
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 Berst…