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

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

Namespace Prefixes

PrefixIRI
n7http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n13http://localhost/temp/predkladatel/
n9http://purl.org/net/nknouf/ns/bibtex#
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/resource/domain/vavai/subjekt/
n5http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21240%2F11%3A00183720%21RIV12-MSM-21240___/
n14http://linked.opendata.cz/ontology/domain/vavai/
n18http://linked.opendata.cz/resource/domain/vavai/zamer/
n16https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://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#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21240%2F11%3A00183720%21RIV12-MSM-21240___
rdf:type
n14:Vysledek skos:Concept
dcterms:description
Regular tree expressions are a formalism for describing regular tree languages, which can be accepted by finite tree automata. The class of regular tree languages is a proper subclass of tree languages whose linear notations can be accepted by deterministic string pushdown automata. In this paper we present a simple and straightforward way of transforming a regular tree expression to an equivalent height-deterministic pushdown automaton which reads input ranked and unranked ordered trees in postfix and postfix bar notation, respectively. Regular tree expressions are a formalism for describing regular tree languages, which can be accepted by finite tree automata. The class of regular tree languages is a proper subclass of tree languages whose linear notations can be accepted by deterministic string pushdown automata. In this paper we present a simple and straightforward way of transforming a regular tree expression to an equivalent height-deterministic pushdown automaton which reads input ranked and unranked ordered trees in postfix and postfix bar notation, respectively.
dcterms:title
Regular Tree Expressions and Deterministic Pushdown Automata Regular Tree Expressions and Deterministic Pushdown Automata
skos:prefLabel
Regular Tree Expressions and Deterministic Pushdown Automata Regular Tree Expressions and Deterministic Pushdown Automata
skos:notation
RIV/68407700:21240/11:00183720!RIV12-MSM-21240___
n14:predkladatel
n17:orjk%3A21240
n3:aktivita
n15:Z n15:S
n3:aktivity
S, Z(MSM6840770014)
n3:dodaniDat
n11:2012
n3:domaciTvurceVysledku
n8:3764818 n8:9851070 n8:5999081
n3:druhVysledku
n22:D
n3:duvernostUdaju
n12:S
n3:entitaPredkladatele
n5:predkladatel
n3:idSjednocenehoVysledku
226267
n3:idVysledku
RIV/68407700:21240/11:00183720
n3:jazykVysledku
n21:eng
n3:klicovaSlova
trees; regular tree expressions; pushdown automata
n3:klicoveSlovo
n4:trees n4:pushdown%20automata n4:regular%20tree%20expressions
n3:kontrolniKodProRIV
[30DC73EBE6D1]
n3:mistoKonaniAkce
Lednice
n3:mistoVydani
Brno
n3:nazevZdroje
Proceeding of the 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
n3:obor
n19:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:rokUplatneniVysledku
n11:2011
n3:tvurceVysledku
Melichar, Bořivoj Janoušek, Jan Polách, Radomír
n3:typAkce
n7:CST
n3:zahajeniAkce
2011-10-14+02:00
n3:zamer
n18:MSM6840770014
s:numberOfPages
8
n9:hasPublisher
Vysoké učení technické v Brně
n16:isbn
978-80-214-4305-1
n13:organizacniJednotka
21240