Corrigendum to our paper: How Expressions Can Code for Automata
Sylvain Lombardy, Jacques Sakarovitch (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
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...