Skip to Main content Skip to Navigation
Journal articles

Corrigendum to our paper : How Expressions can code for Automata

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00692898
Contributor : Sylvain Lombardy <>
Submitted on : Tuesday, May 1, 2012 - 4:43:12 PM
Last modification on : Friday, July 31, 2020 - 10:44:07 AM

Links full text

Identifiers

Citation

Sylvain Lombardy, Jacques Sakarovitch. Corrigendum to our paper : How Expressions can code for Automata. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2010, 44 (3), pp.339--361. ⟨10.1051/ita/2010019⟩. ⟨hal-00692898⟩

Share

Metrics

Record views

274