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.
|
 |
Inverse problems for finite automata: A solution based on genetic algorithms
| Book Series | Lecture Notes in Computer Science |
| Publisher | Springer Berlin / Heidelberg |
| ISSN | 0302-9743 (Print) 1611-3349 (Online) |
| Volume | Volume 1363/1998 |
| Book | Artificial Evolution |
| DOI | 10.1007/BFb0026588 |
| Copyright | 1998 |
| ISBN | 978-3-540-64169-8 |
| Category | Applications |
| DOI | 10.1007/BFb0026598 |
| Pages | 157-166 |
| Subject Collection | Computer Science |
| SpringerLink Date | Monday, April 10, 2006 |
| |
|
Applications
Inverse problems for finite automata: A solution based on genetic algorithms
B. Leblanc1 , E. Lutton1 and J. -P. Allouche2 
| (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  ALGON  , our home-made Genetic Algorithm software.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|