On the Average Size of Glushkov's Automata
Résumé
Glushkov's algorithm builds an epsilon-free nondeterministic automaton from a given regular expression. In the worst case, its number of states is linear and its number of transitions is quadratic in the size of the expression. We show in this paper that in average, the number of transitions is linear.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...