Skip to content

Provably Shorter Regular Expressions from Deterministic Finite Automata.

Hermann Gruber, Markus Holzer

VenueCDLT
Year2008
ProceedingsDevelopments in Language Theory

Browse the full DLT paper archive.