From Regular Weighted Expressions To Finite Automata

In this article we generalize concepts of the position automaton and ZPC-structure to the regular -expressions. We show that the extended ZPC-structure can be built in linear time w.r.t. the size of the -expression and that the associated position automaton can be deduced from it in quadratic time.