Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Inverse problems for finite automata: a solution based on Genetic Algorithms

Summary: Inverse problems for finite automata: a solution
based on Genetic Algorithms
B. Leblanc 1 , E. Lutton 1 and J.­P. Allouche 2
1 INRIA ­ Rocquencourt, B.P. 105, F­78153 LE CHESNAY Cedex, France
Tel: +33 (0)1 39 63 55 23 ­ Fax: +33 (0)1 39 63 59 95
e­mail: Benoit.Leblanc@inria.fr, Evelyne.Lutton@inria.fr
2 CNRS, LRI, B“at. 490, Universit'e Paris­Sud, F­91405 Orsay Cedex, France
Tel: 33 (0)1 69 15 64 54
e­mail: Jean­Paul.Allouche@lri.fr
Abstract. The use of heuristics such as Genetic Algorithm optimisation
methods is appealing in a large range of inverse problems. The problem
presented here deals with the mathematical analysis of sequences gen­
erated by finite automata. There is no known general exact method for
solving the associated inverse problem. GA optimisation techniques can
provide useful results, even in the very particular area of mathematical
analysis. This paper presents the results we have obtained on the inverse
problem for fixed point automata. Software implementation has been de­
veloped with the help of ``ALGON'', our home­made Genetic Algorithm


Source: Allouche, Jean-Paul - Laboratoire de Recherche en Informatique, Université de Paris-Sud 11


Collections: Computer Technologies and Information Sciences