About: Regular Grammar Transformation Inspired by the Graph Distance Using GA

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Regular Grammar Transformation Inspired by the Graph Distance Using GA Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www.nnw.cz
Description	This paper introduces a method how to transform one regular grammar to the second one. The transformation is based on regular grammar distance computation. Regular grammars are equivalent to finite states machines and they are represented by oriented graphs or by transition matrices, respectively. Thus, the regular grammar distance is defined analogously to the distance between two graphs. The distance is measured as the minimal count of elementary operations over the grammar which transform the first grammar to the second one. The distance is computed by searching an optimal mapping of non-terminal symbols of both grammars. The computation itself is done by the genetic algorithm because the exhaustive evaluation of mapping leads to combinatorial explosion. Transformation steps are derived from differences in matrices. Differences are identified during the computation of the distance. This paper introduces a method how to transform one regular grammar to the second one. The transformation is based on regular grammar distance computation. Regular grammars are equivalent to finite states machines and they are represented by oriented graphs or by transition matrices, respectively. Thus, the regular grammar distance is defined analogously to the distance between two graphs. The distance is measured as the minimal count of elementary operations over the grammar which transform the first grammar to the second one. The distance is computed by searching an optimal mapping of non-terminal symbols of both grammars. The computation itself is done by the genetic algorithm because the exhaustive evaluation of mapping leads to combinatorial explosion. Transformation steps are derived from differences in matrices. Differences are identified during the computation of the distance. (en)
Title	Regular Grammar Transformation Inspired by the Graph Distance Using GA Regular Grammar Transformation Inspired by the Graph Distance Using GA (en)
skos:prefLabel	Regular Grammar Transformation Inspired by the Graph Distance Using GA Regular Grammar Transformation Inspired by the Graph Distance Using GA (en)
skos:notation	RIV/68407700:21260/11:00183348!RIV12-MSM-21260___
http://linked.open...avai/riv/aktivita	I
http://linked.open...avai/riv/aktivity	I
http://linked.open...iv/cisloPeriodika	4
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Fábera, Vít Zelenka, Jan Jáneš, Vlastimil Jánešová, Mária
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta dopravní
http://linked.open...dnocenehoVysledku	226266
http://linked.open...ai/riv/idVysledku	RIV/68407700:21260/11:00183348
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Finite state machine; automata; graph; graph distance; regular grammar distance; genetic algorithm (en)
http://linked.open.../riv/klicoveSlovo	graph automata genetic algorithm Finite state machine graph distance regular grammar distance
http://linked.open...odStatuVydavatele	CZ - Česká republika
http://linked.open...ontrolniKodProRIV	[9EBA8BC4437A]
http://linked.open...i/riv/nazevZdroje	Neural Network World
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	4 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...UplatneniVysledku	2011
http://linked.open...v/svazekPeriodika	21
http://linked.open...iv/tvurceVysledku	Jánešová, Mária Zelenka, Jan Fábera, Vít Jáneš, Vlastimil
http://linked.open...ain/vavai/riv/wos	000295384200002
issn	1210-0552
number of pages	11 (xsd:int)
http://localhost/t...ganizacniJednotka	21260

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software