Provably shorter regular expressions from deterministic finite automata. (2008)

by H Gruber, M Holzer
Venue:Proceedings of the 12th International Conference Developments in Language Theory, number 5257 in LNCS,