Preprints, Working Papers, ... Year : 2012

On the transition reduction problem for finite automata

Abstract

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.
Fichier principal
Vignette du fichier
articleLNCS.pdf (234) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00779496 , version 1 (22-01-2013)

Identifiers

  • HAL Id : hal-00779496 , version 1

Cite

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

Share

More