Sciweavers

FSTTCS
2008
Springer

An Optimal Construction of Finite Automata from Regular Expressions

13 years 4 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 intermediate graph represents an extended finite automaton accepting the same language. The character of our construction allows a fine-grained analysis of the emerging automaton’s size, eventually leading to an optimality result.
Stefan Gulan, Henning Fernau
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2008
Where FSTTCS
Authors Stefan Gulan, Henning Fernau
Comments (0)