This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
9th EUROMICRO Conference on Digital System Design (DSD'06)
Automata Construct with Genetic Algorithm
Cavtat near Dubrovnik, Croatia
August 30-September 01
ISBN: 0-7695-2609-8
V?t F?bera, Czech Technical University, Czech Republic
Vlastimil J?nes, Czech Technical University, Czech Republic
M?ria J?nesov?, Czech Technical University, Czech Republic
A finite state machine (FSM) is a behavioural model of digital hardware. The "revolutionary programming" algorithm was created in 60?s by Fogel and it was the first attempt to construct a FSM by evolutionary principle, but only with usage a mutation operator. Lucas and Reynolds tried to construct FSMs without output function using genetic algorithm (for purpose of lexical analysers). This contribution describes experiments with a standard genetic algorithms (SGA) on more general FSMs (Moore and Mealy). It compares simple GA with those, where the mutation affected by the probability. The minimisation is built-in genetic algorithm. The algorithm is tested on several examples.
Citation:
V?t F?bera, Vlastimil J?nes, M?ria J?nesov?, "Automata Construct with Genetic Algorithm," dsd, pp.460-463, 9th EUROMICRO Conference on Digital System Design (DSD'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.