Corrigendum to our paper: How Expressions Can Code for Automata
IGM-LabInfo (UMR 8049), Université Paris-Est Marne-la-Vallée, 77454 Marne-la-Vallée Cedex 2, France;
2 LTCI (UMR 5141), CNRS/Télécom ParisTech, 46 rue Barrault, 75634 Paris Cedex 13, France; email@example.com.
Accepted: 23 June 2010
In a previous paper, we have described the construction of an automaton from a rational expression which has the property that the automaton built from an expression which is itself computed from a co-deterministic automaton by the state elimination method is co-deterministic. It turned out that the definition on which the construction is based was inappropriate, and thus the proof of the property was flawed. We give here the correct definition of the broken derived terms of an expression which allow to define the automaton and the detailed full proof of the property.
Mathematics Subject Classification: 68Q45 / 68Q70
Key words: Finite automata / regular expression / derivation of expressions / quotient of automata.
© EDP Sciences, 2010