Sciweavers

LATIN
2004
Springer

How Expressions Can Code for Automata

13 years 9 months ago
How Expressions Can Code for Automata
In this paper we investigate how it is possible to recover an automaton from a rational expression that has been computed from that automaton. The notion of derived term of an expression, introduced by Antimirov, appears to be instrumental in this problem. The second important ingredient is the co-minimization of an automaton, a dual and generalized Moore algorithm on non-deterministic automata. We show here that if an automaton is then sufficiently “decorated”, the combination of these two algorithms gives the desired result. Reducing the amount of “decoration” is still the object of ongoing investigation. 1991 Mathematics Subject Classification. 68Q45, 68Q70. dedicated to Imre Simon on the occasion of his 60th birtday
Sylvain Lombardy, Jacques Sakarovitch
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where LATIN
Authors Sylvain Lombardy, Jacques Sakarovitch
Comments (0)