Provably Shorter Regular Expressions from Finite Automata

Hermann Gruber, Markus Holzer. Provably Shorter Regular Expressions from Finite Automata. Int. J. Found. Comput. Sci., 24(8):1255-1280, 2013. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.