This HTML5 document contains 46 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/
n22http://purl.org/net/nknouf/ns/bibtex#
n13http://localhost/temp/predkladatel/
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n4http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
n21http://linked.opendata.cz/resource/domain/vavai/zamer/
n18https://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#
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F06%3A00206167%21RIV10-GA0-11320___/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F06%3A00206167%21RIV10-GA0-11320___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we introduce and study a new type of restarting automaton, the so-called t-sRL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. Here we study the gap-complexity of these automata. The membership problem for a language that is accepted by a t-sRL-automaton with a bounded number of gaps can be solved in polynomial time. On the other hand, t-sRL-automata with an unbounded number of gaps accept NP-complete languages. Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we introduce and study a new type of restarting automaton, the so-called t-sRL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. Here we study the gap-complexity of these automata. The membership problem for a language that is accepted by a t-sRL-automaton with a bounded number of gaps can be solved in polynomial time. On the other hand, t-sRL-automata with an unbounded number of gaps accept NP-complete languages.
dcterms:title
On the gap-complexity of simple RL-automata On the gap-complexity of simple RL-automata
skos:prefLabel
On the gap-complexity of simple RL-automata On the gap-complexity of simple RL-automata
skos:notation
RIV/00216208:11320/06:00206167!RIV10-GA0-11320___
n3:aktivita
n10:P n10:Z
n3:aktivity
P(1ET100300517), P(GA201/04/2102), Z(MSM0021620838)
n3:dodaniDat
n15:2010
n3:domaciTvurceVysledku
n9:2985640 n9:5680050
n3:druhVysledku
n12:D
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
490457
n3:idVysledku
RIV/00216208:11320/06:00206167
n3:jazykVysledku
n11:eng
n3:klicovaSlova
gap-complexity; simple; RL-automata
n3:klicoveSlovo
n8:simple n8:gap-complexity n8:RL-automata
n3:kontrolniKodProRIV
[9A18C31DFFA5]
n3:mistoKonaniAkce
Berlin
n3:mistoVydani
Berlin
n3:nazevZdroje
Developments in Language Theory
n3:obor
n16:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
3
n3:projekt
n4:GA201%2F04%2F2102 n4:1ET100300517
n3:rokUplatneniVysledku
n15:2006
n3:tvurceVysledku
Plátek, Martin Mráz, František Otto, Friedrich
n3:typAkce
n7:WRD
n3:wos
000239454100009
n3:zahajeniAkce
2006-01-01+01:00
n3:zamer
n21:MSM0021620838
s:numberOfPages
12
n22:hasPublisher
Springer-Verlag
n18:isbn
978-3-540-35428-4
n13:organizacniJednotka
11320