This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n3http://localhost/temp/predkladatel/
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F08%3APU80184%21RIV10-MSM-26230___/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/kodPristupu/
skoshttp://www.w3.org/2004/02/skos/core#
rdfshttp://www.w3.org/2000/01/rdf-schema#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F08%3APU80184%21RIV10-MSM-26230___
rdf:type
skos:Concept n16:Vysledek
rdfs:seeAlso
http://www.fit.vutbr.cz/~holik/pub/FIT-TR-2008-005.pdf
dcterms:description
In this paper, we address the problem of reducing the size of non- deterministic (bottom-up) tree automata. We propose a uniform framework that allows for combining various upward and downward bisimulation and simulation relations in order to obtain a language-preserving combined relation suitable for reducing tree automata without a need to determinise them. The framework gen- eralises and improves several previous works and provides a broad spectrum of different relations yielding a possibility of a ?ne choice between the amount of re- duction and the computational demands. We analyse properties of the considered relations both theoretically as well as through a series of experiments.<br>&nbsp; In this paper, we address the problem of reducing the size of non- deterministic (bottom-up) tree automata. We propose a uniform framework that allows for combining various upward and downward bisimulation and simulation relations in order to obtain a language-preserving combined relation suitable for reducing tree automata without a need to determinise them. The framework gen- eralises and improves several previous works and provides a broad spectrum of different relations yielding a possibility of a ?ne choice between the amount of re- duction and the computational demands. We analyse properties of the considered relations both theoretically as well as through a series of experiments.<br>&nbsp;
dcterms:title
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
skos:prefLabel
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
skos:notation
RIV/00216305:26230/08:PU80184!RIV10-MSM-26230___
n4:aktivita
n7:Z n7:P
n4:aktivity
P(GA102/07/0322), P(GD102/05/H050), Z(MSM0021630528)
n4:dodaniDat
n10:2010
n4:domaciTvurceVysledku
n17:9761985 n17:1258486
n4:druhVysledku
n19:A
n4:duvernostUdaju
n9:S
n4:entitaPredkladatele
n13:predkladatel
n4:idSjednocenehoVysledku
354595
n4:idVysledku
RIV/00216305:26230/08:PU80184
n4:jazykVysledku
n18:eng
n4:klicovaSlova
tree automata, bisimulation, simulation, size reduction, framework<br>
n4:klicoveSlovo
n5:size%20reduction n5:bisimulation n5:tree%20automata n5:framework%3Cbr%3E n5:simulation
n4:kodPristupu
n14:V
n4:kontrolniKodProRIV
[CA4BEC33D4F7]
n4:obor
n20:JC
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
4
n4:projekt
n6:GA102%2F07%2F0322 n6:GD102%2F05%2FH050
n4:rokUplatneniVysledku
n10:2008
n4:tvurceVysledku
Holík, Lukáš Kaati, Lisa Abdulla, Parosh Vojnar, Tomáš
n4:zamer
n12:MSM0021630528
n3:organizacniJednotka
26230