On the Average Size of Glushkov's Automata

Abstract. Glushkov’s algorithm builds an ε-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.

• Type: Conference
• Year: 2009
• Where: LATA
• Authors: Cyril Nicaud
• Keywords: Automata Theory, LATA 2009, Regular Expression, Worst Case, ε-free Nondeterministic Automaton