Další formáty:
BibTeX
LaTeX
RIS
@article{881356, author = {Brožek, Václav}, article_location = {Amsterdam, The Netherlands}, article_number = {251}, keywords = {regular languages; probabilistic pushdown games; reachability}, language = {eng}, issn = {1571-0661}, journal = {Electronic Notes in Theoretical Computer Science}, title = {Regularity in PDA Games Revisited}, url = {http://dx.doi.org/10.1016/j.entcs.2009.08.024}, volume = {2009}, year = {2009} }
TY - JOUR ID - 881356 AU - Brožek, Václav PY - 2009 TI - Regularity in PDA Games Revisited JF - Electronic Notes in Theoretical Computer Science VL - 2009 IS - 251 SP - 5-16 EP - 5-16 PB - Elsevier Science Publishers SN - 15710661 KW - regular languages KW - probabilistic pushdown games KW - reachability UR - http://dx.doi.org/10.1016/j.entcs.2009.08.024 N2 - 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. ER -
BROŽEK, Václav. Regularity in PDA Games Revisited. \textit{Electronic Notes in Theoretical Computer Science}. Amsterdam, The Netherlands: Elsevier Science Publishers, roč.~2009, č.~251, s.~5-16. ISSN~1571-0661. 2009.
|