Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Applications

Inverse problems for finite automata: A solution based on genetic algorithms

B. LeblancContact Information, E. LuttonContact Information and J. -P. AlloucheContact Information

(1)  INRIA - Rocquencourt, B.P. 105, F-78153 LE CHESNAY Cedex, France
(2)  CNRS, LRI, Bât. 490, Université Paris-Sud, F-91405 Orsay Cedex, France
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 generated 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 developed with the help of ldquoALGONrdquo, our home-made Genetic Algorithm software.

Contact Information B. Leblanc
Email: Benoit.Leblanc@inria.fr
Fax: +33 (0)1 39 63 59 95
URL: http://www-rocq.inria.fr/fractales/

Contact Information E. Lutton
Email: Evelyne.Lutton@inria.fr

Contact Information J. -P. Allouche
Email: Jean-Paul.Allouche@lri.fr
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.105 • Server: mpweb15
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)