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.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00779496
Contributor : El Houcein El Abdalaoui <>
Submitted on : Tuesday, January 22, 2013 - 3:26:29 PM
Last modification on : Wednesday, September 4, 2019 - 1:52:06 PM
Long-term archiving on : Tuesday, April 23, 2013 - 3:53:00 AM

File

articleLNCS.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00779496, version 1

Citation

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

Share

Metrics

Record views

467

Files downloads

159