On the size of the universal automaton of a regular language

Sylvain Lombardy (1)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge

The universal automaton of a regular language is the maximal NFA without merging states that recognizes this language. This automaton is directly inspired by the factor matrix defined by Conway thirty years ago. We prove in this paper that a tight bound on its size with respect to the size of the smallest equivalent NFA is given by Dedekind's numbers. At the end of the paper, we deal with the unary case. Chrobak has proved that the size of the minimal deterministic automaton with respect to the smallest NFA is tightly bounded by the Landau's function; we show that the size of the universal automaton is in this case an exponential of the Landau's function.

Mots clés: Universal automa; minimal NFA

Domaines: Mathématique discrète [cs.DM]

Sylvain Lombardy. On the size of the universal automaton of a regular language. STACS'07, Feb 2007, BERLIN, Germany. pp.85--96, ⟨10.1007/978-3-540-70918-3_8⟩. ⟨hal-00139652⟩