On the Average Size of Glushkov's Automata

Cyril Nicaud (1)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge

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.

Domaines: Mathématique discrète [cs.DM]; Traitement du texte et du document

Cyril Nicaud. On the Average Size of Glushkov's Automata. 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), Apr 2009, Tarragona, Spain. pp.626-637, ⟨10.1007/978-3-642-00982-2_53⟩. ⟨hal-00430482⟩