This HTML5 document contains 47 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/
n18http://localhost/temp/predkladatel/
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/ontology/domain/vavai/
n14http://linked.opendata.cz/resource/domain/vavai/zamer/
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%3A00002274%21RIV07-AV0-11320___/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F06%3A00002274%21RIV07-AV0-11320___
rdf:type
n5:Vysledek skos:Concept
dcterms:description
In the literature various notions of monotonicity for restarting automata have been studied. Here we introduce two new variants of monotonicity for restarting automata and for two-way restarting automata: left-monotonicity and right-left monotonicity. It is shown that the Various types of deterministic and nondeterministic restarting automata without auxiliary symbols, these notions yield infinite hierarchies, and we compare these hierarchies to each other. Further, as a tool used to simplify some of the proofs, the shrinking restarting automaton is introduced, which is a generalization of the standard restarting automaton to the weight-reducing case. Some of the consequences of this generalization are also discussed. In the literature various notions of monotonicity for restarting automata have been studied. Here we introduce two new variants of monotonicity for restarting automata and for two-way restarting automata: left-monotonicity and right-left monotonicity. It is shown that the Various types of deterministic and nondeterministic restarting automata without auxiliary symbols, these notions yield infinite hierarchies, and we compare these hierarchies to each other. Further, as a tool used to simplify some of the proofs, the shrinking restarting automaton is introduced, which is a generalization of the standard restarting automaton to the weight-reducing case. Some of the consequences of this generalization are also discussed. V pramenech se studují rozličné varianty pojmu monotonie pro restartovací automaty. Zde se zavádí dvě nové varianty monotonie pro restartovací automaty: levá monotonie a pravo-levá monotonie. Jsou presentovány a porovnávány rozličné hierarchie jazyků založené na těchto pojmech. Zprvu jako technický prostředek byly zavedeny shrinking restartovací automaty , které zobecňují standardní restartovací automaty tak, že místo zkracování zmenšují jisté ohodnocení řetězů. Jsou diskutovány důsledky této generalizace.
dcterms:title
Degrees of non-monotonicity for restarting automata, Degrees of non-monotonicity for restarting automata, Stupně monotonie pro restartovací automaty
skos:prefLabel
Degrees of non-monotonicity for restarting automata, Degrees of non-monotonicity for restarting automata, Stupně monotonie pro restartovací automaty
skos:notation
RIV/00216208:11320/06:00002274!RIV07-AV0-11320___
n3:strany
1;34
n3:aktivita
n6:Z n6:P
n3:aktivity
P(1ET100300517), P(GA201/04/2102), Z(MSM0021620838)
n3:cisloPeriodika
366
n3:dodaniDat
n9:2007
n3:domaciTvurceVysledku
n16:5680050 n16:2985640
n3:druhVysledku
n12:J
n3:duvernostUdaju
n8:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
470681
n3:idVysledku
RIV/00216208:11320/06:00002274
n3:jazykVysledku
n17:eng
n3:klicovaSlova
Degrees; non-monotonicity; restarting; automata
n3:klicoveSlovo
n4:non-monotonicity n4:Degrees n4:automata n4:restarting
n3:kodStatuVydavatele
FR - Francouzská republika
n3:kontrolniKodProRIV
[DE37DEFB5031]
n3:nazevZdroje
Theoretical Computer Science
n3:obor
n11:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
4
n3:projekt
n13:GA201%2F04%2F2102 n13:1ET100300517
n3:rokUplatneniVysledku
n9:2006
n3:svazekPeriodika
366
n3:tvurceVysledku
Mráz, František Plátek, Martin
n3:zamer
n14:MSM0021620838
s:issn
0304-3975
s:numberOfPages
34
n18:organizacniJednotka
11320