Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T18:19:16.467Z Has data issue: false hasContentIssue false

Corrigendum to our paper:How Expressions Can Code for Automata

Published online by Cambridge University Press:  28 July 2010

Sylvain Lombardy
Affiliation:
IGM-LabInfo (UMR 8049), Université Paris-Est Marne-la-Vallée, 77454 Marne-la-Vallée Cedex 2, France; lombardy@univ-mlv.fr.
Jacques Sakarovitch
Affiliation:
LTCI (UMR 5141), CNRS/Télécom ParisTech, 46 rue Barrault, 75634 Paris Cedex 13, France; sakarovitch@enst.fr.
Get access

Abstract

In a previous paper, we have described the construction of anautomaton from a rational expression which has the property thatthe 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 the construction isbased was inappropriate, and thus the proof of the property wasflawed. We give here the correct definition of the broken derived termsof an expression which allow to define the automaton and thedetailed full proof of the property.

Information

Type
Research Article
Copyright
© EDP Sciences, 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable