FSM Construct with Genetic Algorithm Using Distance Measuring in Mutation Operator
Result description
Our approach to the FSM construction using genetic algorithm was presented in a several contributions. The FSM was represented by matrices. The one-point crossover operator mixed two matrices and the mutation changed one transition or output. Very difficult tasks were these ones where FSMs recognize given subsequences in the serial bit sequences. Transition graphs of these FSMs contained trees as their sub-graphs. The algorithm achieved certain fitness and then it stagnated on. We modified the mutationoperator. We defined and computed the distance between two FSMs and we add the distance measurement into the mutation operator. Now the mutation changes the FSM so that the distance between the original FSM and mutated one is greater than predefined threshold.
Keywords
The result's identifiers
Result code in IS VaVaI
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
FSM Construct with Genetic Algorithm Using Distance Measuring in Mutation Operator
Original language description
Our approach to the FSM construction using genetic algorithm was presented in a several contributions. The FSM was represented by matrices. The one-point crossover operator mixed two matrices and the mutation changed one transition or output. Very difficult tasks were these ones where FSMs recognize given subsequences in the serial bit sequences. Transition graphs of these FSMs contained trees as their sub-graphs. The algorithm achieved certain fitness and then it stagnated on. We modified the mutationoperator. We defined and computed the distance between two FSMs and we add the distance measurement into the mutation operator. Now the mutation changes the FSM so that the distance between the original FSM and mutated one is greater than predefined threshold.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of 17th International Conference on Soft Computing (MENDEL 2011)
ISBN
978-80-214-4302-0
ISSN
1803-3814
e-ISSN
—
Number of pages
5
Pages from-to
62-66
Publisher name
VUT v Brně
Place of publication
Brno
Event location
Brno
Event date
Jun 15, 2011
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—
Basic information
Result type
D - Article in proceedings
CEP
IN - Informatics
Year of implementation
2011