Regular Grammar Transformation Using Graph Distance Computed by GA
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F10%3A00174779" target="_blank" >RIV/68407700:21260/10:00174779 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Regular Grammar Transformation Using Graph Distance Computed by GA
Original language description
This article introduce the method how to compute regular grammars distances. Grammars are equivalent to finite states machines and they are represented by oriented graphs. Then the grammar distance is defined as graph distance between two graphs (finitestate machines). The computation itself is done by the genetic algorithm because the exhaustive graph comparison leads to combinatorial explosion. The grammar transformation is based on optimal mapping nonterminal symbols which is a product of the distance computation. Transformation steps are given by differences identified during the distance computation.
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
2010
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 2010
ISBN
978-80-214-4120-0
ISSN
1803-3814
e-ISSN
—
Number of pages
5
Pages from-to
86-90
Publisher name
VUT v Brně
Place of publication
Brno
Event location
Brno
Event date
Jun 23, 2010
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
000288144100013