This HTML5 document contains 44 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/
n4http://localhost/temp/predkladatel/
n12http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n11http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
n14http://linked.opendata.cz/resource/domain/vavai/zamer/
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F08%3A00207396%21RIV10-MSM-11320___/
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#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F08%3A00207396%21RIV10-MSM-11320___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
Restarting automata constitute a special class of regulated length-reducing rewriting systems. In this paper, several versions of these automata and a (strict) monotonicity property imposed on their computations are considered. This yields three natural possibilities for defining when an automaton is (strictly) monotonic. A taxonomy of the relevant language classes is provided, and the decidability questions for the studied properties are answered. Restarting automata constitute a special class of regulated length-reducing rewriting systems. In this paper, several versions of these automata and a (strict) monotonicity property imposed on their computations are considered. This yields three natural possibilities for defining when an automaton is (strictly) monotonic. A taxonomy of the relevant language classes is provided, and the decidability questions for the studied properties are answered.
dcterms:title
Monotonicity of restarting automata Monotonicity of restarting automata
skos:prefLabel
Monotonicity of restarting automata Monotonicity of restarting automata
skos:notation
RIV/00216208:11320/08:00207396!RIV10-MSM-11320___
n3:aktivita
n9:P n9:Z
n3:aktivity
P(1ET100300517), P(1M0567), Z(MSM0021620838)
n3:cisloPeriodika
1
n3:dodaniDat
n8:2010
n3:domaciTvurceVysledku
n12:2985640 n12:5680050
n3:druhVysledku
n5:J
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n18:predkladatel
n3:idSjednocenehoVysledku
380560
n3:idVysledku
RIV/00216208:11320/08:00207396
n3:jazykVysledku
n15:eng
n3:klicovaSlova
Monotonicity; restarting; automata
n3:klicoveSlovo
n10:restarting n10:Monotonicity n10:automata
n3:kodStatuVydavatele
DE - Spolková republika Německo
n3:kontrolniKodProRIV
[59C7D2429C45]
n3:nazevZdroje
Journal of Automata, Languages and Combinatorics
n3:obor
n16:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
4
n3:projekt
n11:1M0567 n11:1ET100300517
n3:rokUplatneniVysledku
n8:2008
n3:svazekPeriodika
12
n3:tvurceVysledku
Plátek, Martin Jančar, Petr Vogel, Joerg Mráz, František
n3:zamer
n14:MSM0021620838
s:issn
1430-189X
s:numberOfPages
17
n4:organizacniJednotka
11320