On the transition reduction problem for finite automata

El Houcein El Abdalaoui (1) , Mohamed Dahmoune (2) , Djelloul Ziadi (3)

1 LMRS - Laboratoire de Mathématiques Raphaël Salem
2 LACL - Laboratoire d'Algorithmique Complexité et Logique
3 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes

We are interested in the problem of transition reduction of nondeterministic automata. We present some results on the reduction of the automata recognizing the language $L(E_n)$ denoted by the regular expression $E_n=(1+\varepsilon)\cdot (2+\varepsilon)\cdot (3+\varepsilon)\cdots (n+\varepsilon)$. These results can be used in the general case of the transition reduction problem.

Mots clés: $P$-trees

Mots clés: language; automata; reduction; deterministic minimal automaton; state; regular expression; $Z$-partition; $P$-trees.

Domaines: Informatique et langage [cs.CL]; Mathématique discrète [cs.DM]

El Houcein El Abdalaoui, Mohamed Dahmoune, Djelloul Ziadi. On the transition reduction problem for finite automata. 2012. ⟨hal-00779496⟩