By Topic

Finite state machine optimization using genetic algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
O. Garnica ; Dept. de Inf. y Autom., Univ. Complutense de Madrid, Spain ; J. Lanchares ; J. M. Sanchez

We present the results we have obtained after applying techniques on a basis of genetic methodology to the resolution of problems related with the automatic synthesis of digital circuits. We tackle the minimization of the number of states in incompletely specified finite state machines and the optimal state assignment on two level logic. Both class of problems involves the resolution of NP problems. In the first case, we have used a classical genetic algorithm. In the second one have been used new types of operators and ways of representation to avoid the problems that appear. Finally, we try to find the optimal mutation probability which guarantees the exploration of new regions of solution space without search becoming aleatory

Published in:

Genetic Algorithms in Engineering Systems: Innovations and Applications, 1997. GALESIA 97. Second International Conference On (Conf. Publ. No. 446)

Date of Conference:

2-4 Sep 1997