|
|
|
|
|
Faissal Ouardi, Zineb Lotfi and Bilal Elghadyry
This paper describes a fast algorithm for constructing directly the equation automaton from the well-known Thompson automaton associated with a regular expression. Allauzen and Mohri have presented a unified construction of small automata and gave a cons...
ver más
|
|
|
|
|