Grammatical Evolution and FSM Construction
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F12%3A00197202" target="_blank" >RIV/68407700:21260/12:00197202 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Grammatical Evolution and FSM Construction
Original language description
Our FSM construction using genetic algorithm was presented in previous years. The algorithm was tested on several tasks. Some of them were very difficult for GA - tasks where FSMs recognize given subsequences in the serial bit sequences. Transition graphs of these FSMs contain trees as their sub-graphs. The last improvement of the algorithm uses a language representation of the FSM and the grammatical evolution. The FSM is described by switch command like in the C language. The syntax of the language isdefined by context-free grammar. The FSM is coded by linear codon. A new criterion computing the count of loops was added to the fitness function. The improvement was verified on difficult problems by experiments.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2012
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
Mendel 2012
ISBN
978-80-214-4540-6
ISSN
1803-3814
e-ISSN
—
Number of pages
6
Pages from-to
94-99
Publisher name
VUT v Brně, Fakulta strojního inženýrství
Place of publication
Brno
Event location
Brno
Event date
Jun 27, 2012
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—