A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Corrigendum to our paper: How Expressions Can Code for Automata

2010
*
RAIRO - Theoretical Informatics and Applications
*

We correct a mistake made in a previous paper in the construction of an automaton from a rational expression. We used there the definition of derivation of expression given by Antimirov, and this definition has to be further adapted for our purpose. In [7], we were considering the following problem: Is it possible to build an algorithm Ω such that for any rational expression E computed from an automaton A -i.e. E = Φ(A) where Φ is the state elimination method for instance -the following holds:

doi:10.1051/ita/2010019
fatcat:voyxh22nsbahjg4ep2pmu7ri34