Sciweavers

65
Voted
FSTTCS
2008
Springer
14 years 10 months ago
An Optimal Construction of Finite Automata from Regular Expressions
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
Stefan Gulan, Henning Fernau