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

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

Namespace Prefixes

PrefixIRI
n9http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://localhost/temp/predkladatel/
n17http://purl.org/net/nknouf/ns/bibtex#
n13http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/ontology/domain/vavai/
n16https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
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#
n12http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F05%3A00012176%21RIV06-GA0-27240___/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F05%3A00012176%21RIV06-GA0-27240___
rdf:type
n7:Vysledek skos:Concept
dcterms:description
We follow some previous studies of list automata and restarting automata and introduce a generalized and refined model -- a two-way generalized linear list automaton (GLLA) and its subclasses defined by sets of allowed operations. Motivation for the model comes from (computational) linguistics, mainly from the need to express syntactic constraints. We also present several subclasses of GLL-automata, providing some variants and extensions of the Chomsky hierarchy. Our technical results include comparing the expressive power of automata having only move-to-the-right and delete-to-the-left operations with the class of (D)CFL ((deterministic) context-free languages); in particular we show an infinite hierarchy inside DCFL, defined by the increasing size of the read/write lookahead window. We follow some previous studies of list automata and restarting automata and introduce a generalized and refined model -- a two-way generalized linear list automaton (GLLA) and its subclasses defined by sets of allowed operations. Motivation for the model comes from (computational) linguistics, mainly from the need to express syntactic constraints. We also present several subclasses of GLL-automata, providing some variants and extensions of the Chomsky hierarchy. Our technical results include comparing the expressive power of automata having only move-to-the-right and delete-to-the-left operations with the class of (D)CFL ((deterministic) context-free languages); in particular we show an infinite hierarchy inside DCFL, defined by the increasing size of the read/write lookahead window. We follow some previous studies of list automata and restarting automata and introduce a generalized and refined model -- a two-way generalized linear list automaton (GLLA) and its subclasses defined by sets of allowed operations. Motivation for the model comes from (computational) linguistics, mainly from the need to express syntactic constraints. We also present several subclasses of GLL-automata, providing some variants and extensions of the Chomsky hierarchy. Our technical results include comparing the expressive power of automata having only move-to-the-right and delete-to-the-left operations with the class of (D)CFL ((deterministic) context-free languages); in particular we show an infinite hierarchy inside DCFL, defined by the increasing size of the read/write lookahead window.
dcterms:title
Generalized Linear List Automata Generalized Linear List Automata Generalized Linear List Automata
skos:prefLabel
Generalized Linear List Automata Generalized Linear List Automata Generalized Linear List Automata
skos:notation
RIV/61989100:27240/05:00012176!RIV06-GA0-27240___
n4:strany
97-105
n4:aktivita
n20:P
n4:aktivity
P(GA201/02/1456)
n4:dodaniDat
n8:2006
n4:domaciTvurceVysledku
n5:6026508
n4:druhVysledku
n10:D
n4:duvernostUdaju
n15:S
n4:entitaPredkladatele
n12:predkladatel
n4:idSjednocenehoVysledku
522496
n4:idVysledku
RIV/61989100:27240/05:00012176
n4:jazykVysledku
n21:eng
n4:klicovaSlova
list automata
n4:klicoveSlovo
n18:list%20automata
n4:kontrolniKodProRIV
[D5B70724D99A]
n4:mistoKonaniAkce
Popradské Pleso
n4:mistoVydani
Košice
n4:nazevZdroje
ITAT 2004
n4:obor
n11:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
3
n4:projekt
n13:GA201%2F02%2F1456
n4:rokUplatneniVysledku
n8:2005
n4:tvurceVysledku
Jančar, Petr Vogel, J. Plátek, M.
n4:typAkce
n9:CST
n4:zahajeniAkce
2004-09-16+02:00
s:numberOfPages
9
n17:hasPublisher
Univerzita P. J. Šafárika v Košiciach
n16:isbn
80-7097-589-X
n19:organizacniJednotka
27240