77
Voted
FSTTCS
2008
Springer
15 years 7 days ago
2008
Springer
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...