CORRIGENDUM TO OUR PAPER: HOW EXPRESSIONS CAN CODE FOR AUTOMATA

In a previous paper, we have described the constructionof an automaton from a rational expression which has the propertythat the automaton built from an expression which is itself computedfrom a co-deterministic automaton by the state elimination methodis co-deterministic. It turned out that the definition on which theconstruction is based was inappropriate, and thus the proof of theproperty was flawed. We give here the correct definition of the brokenderived terms of an expression which allow to define the automatonand the detailed full proof of the property