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

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

Namespace Prefixes

PrefixIRI
n19http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n14http://purl.org/net/nknouf/ns/bibtex#
n11http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n17http://linked.opendata.cz/ontology/domain/vavai/
n21http://linked.opendata.cz/resource/domain/vavai/zamer/
n15https://schema.org/
shttp://schema.org/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n22http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F07%3A00206133%21RIV10-MSM-11320___/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F07%3A00206133%21RIV10-MSM-11320___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
A nondeterministic restarting automaton M is said to be (strongly) correctness preserving, if, for each cycle u proves(c)(M) v, the word v belongs to the complete language L-C(M) accepted by M, if the word u does. Here, in order to differentiate between nondeterministic restarting automata that are correctness preserving and nondeterministic restarting automata in general we introduce two gradual relaxations of the correctness preserving property. These relaxations lead to an infinite two-dimensional hierarchy of classes of languages with membership problems that are decidable in polynomial time. A nondeterministic restarting automaton M is said to be (strongly) correctness preserving, if, for each cycle u proves(c)(M) v, the word v belongs to the complete language L-C(M) accepted by M, if the word u does. Here, in order to differentiate between nondeterministic restarting automata that are correctness preserving and nondeterministic restarting automata in general we introduce two gradual relaxations of the correctness preserving property. These relaxations lead to an infinite two-dimensional hierarchy of classes of languages with membership problems that are decidable in polynomial time.
dcterms:title
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata
skos:prefLabel
Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata
skos:notation
RIV/00216208:11320/07:00206133!RIV10-MSM-11320___
n5:aktivita
n13:Z n13:P
n5:aktivity
P(1ET100300517), Z(MSM0021620838)
n5:dodaniDat
n12:2010
n5:domaciTvurceVysledku
n8:2985640 n8:5680050
n5:druhVysledku
n16:D
n5:duvernostUdaju
n10:S
n5:entitaPredkladatele
n22:predkladatel
n5:idSjednocenehoVysledku
424049
n5:idVysledku
RIV/00216208:11320/07:00206133
n5:jazykVysledku
n20:eng
n5:klicovaSlova
Hierarchical; Relaxations; Correctness; Preserving; Property; Restarting; Automata
n5:klicoveSlovo
n9:Automata n9:Hierarchical n9:Restarting n9:Preserving n9:Relaxations n9:Property n9:Correctness
n5:kontrolniKodProRIV
[F25E2C9E21A9]
n5:mistoKonaniAkce
Berlin
n5:mistoVydani
Berlin
n5:nazevZdroje
Machines, Computations, and Universality
n5:obor
n7:BA
n5:pocetDomacichTvurcuVysledku
2
n5:pocetTvurcuVysledku
3
n5:projekt
n18:1ET100300517
n5:rokUplatneniVysledku
n12:2007
n5:tvurceVysledku
Otto, Friedrich Plátek, Martin Mráz, František
n5:typAkce
n19:WRD
n5:wos
000249744600020
n5:zahajeniAkce
2007-01-01+01:00
n5:zamer
n21:MSM0021620838
s:numberOfPages
12
n14:hasPublisher
Springer-Verlag
n15:isbn
978-3-540-74592-1
n11:organizacniJednotka
11320