Descriptional and Computational Complexity of Finite Automata.

Markus Holzer, Martin Kutrib

Browse the full LATA paper archive.