Computational Complexity of NFA Minimization for Finite and Unary Languages.

Hermann Gruber, Markus Holzer

Browse the full LATA paper archive.