Provably Shorter Regular Expressions from Deterministic Finite Automata

Hermann Gruber, Markus Holzer. Provably Shorter Regular Expressions from Deterministic Finite Automata. In Masami Ito, Masafumi Toyama, editors, Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings. Volume 5257 of Lecture Notes in Computer Science, pages 383-395, Springer, 2008. [doi]

Abstract

Abstract is missing.