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

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

Namespace Prefixes

PrefixIRI
n14http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n12http://purl.org/net/nknouf/ns/bibtex#
n11http://localhost/temp/predkladatel/
n22http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n19http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
n20https://schema.org/
n9http://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#
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F08%3A00026782%21RIV10-MSM-14330___/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n18http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F08%3A00026782%21RIV10-MSM-14330___
rdf:type
skos:Concept n17:Vysledek
dcterms:description
We study the regularity of sets of winning configurations in countable-state stochastic games played on transition graphs of pushdown automata (PDA games) with reachability objectives. Our main result is proving the regularity of the sets of winning configurations for qualitative reachability objectives. This completes the classification partially given in a previous paper on this topic. We also improve the upper bounds on the regular representation in cases already solved. We further mention a problem which has also been studied recently: determining the \emph{value} of a reachability game. Using our methods we prove the regularity of the set of configurations with value 1 and 0. Our work is related to recent results for stochastic games on countable graphs and sheds more light on some open problems in this area. We study the regularity of sets of winning configurations in countable-state stochastic games played on transition graphs of pushdown automata (PDA games) with reachability objectives. Our main result is proving the regularity of the sets of winning configurations for qualitative reachability objectives. This completes the classification partially given in a previous paper on this topic. We also improve the upper bounds on the regular representation in cases already solved. We further mention a problem which has also been studied recently: determining the \emph{value} of a reachability game. Using our methods we prove the regularity of the set of configurations with value 1 and 0. Our work is related to recent results for stochastic games on countable graphs and sheds more light on some open problems in this area.
dcterms:title
Regularity in PDA Games Revisited Regularity in PDA Games Revisited
skos:prefLabel
Regularity in PDA Games Revisited Regularity in PDA Games Revisited
skos:notation
RIV/00216224:14330/08:00026782!RIV10-MSM-14330___
n3:aktivita
n4:Z n4:P
n3:aktivity
P(1M0545), Z(MSM0021622419)
n3:dodaniDat
n18:2010
n3:domaciTvurceVysledku
n22:5532787
n3:druhVysledku
n16:D
n3:duvernostUdaju
n21:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
392050
n3:idVysledku
RIV/00216224:14330/08:00026782
n3:jazykVysledku
n10:eng
n3:klicovaSlova
regular languages; probabilistic pushdown games; reachability
n3:klicoveSlovo
n7:probabilistic%20pushdown%20games n7:reachability n7:regular%20languages
n3:kontrolniKodProRIV
[75EF34179014]
n3:mistoKonaniAkce
Znojmo
n3:mistoVydani
Brno
n3:nazevZdroje
MEMICS 2008 proceedings
n3:obor
n8:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n19:1M0545
n3:rokUplatneniVysledku
n18:2008
n3:tvurceVysledku
Brožek, Václav
n3:typAkce
n14:WRD
n3:zahajeniAkce
2008-01-01+01:00
n3:zamer
n9:MSM0021622419
s:numberOfPages
8
n12:hasPublisher
L. Matyska, D. Antoš, M. Češka, Z. Kotásek, T. Vojnar, M. Křetínský (Eds.)
n20:isbn
978-80-7355-082-0
n11:organizacniJednotka
14330