Sciweavers

WIA
2005
Springer
14 years 5 months ago
Shorter Regular Expressions from Finite-State Automata
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...
Yo-Sub Han, Derick Wood