FSM Construct with Genetic Algorithm Using Distance Measuring in Mutation Operator

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F11%3A00186916" target="_blank" >RIV/68407700:21260/11:00186916 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

FSM Construct with Genetic Algorithm Using Distance Measuring in Mutation Operator

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

FSM Construct with Genetic Algorithm Using Distance Measuring in Mutation Operator

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of 17th International Conference on Soft Computing (MENDEL 2011)

ISBN

978-80-214-4302-0

ISSN

1803-3814

e-ISSN

—

Počet stran výsledku

5

Strana od-do

62-66

Název nakladatele

VUT v Brně

Místo vydání

Brno

Místo konání akce

Brno

Datum konání akce

15. 6. 2011

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—