"Provably Shorter Regular Expressions from Deterministic Finite Automata."

Hermann Gruber, Markus Holzer (2008)
a service of Schloss Dagstuhl - Leibniz Center for Informatics