Location of Repository

Pushdown games with unboundedness and regular conditions

By Alexis-Julien Bouquet, Olivier Serre and Igor Walukiewicz

Abstract

International audienceWe consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton.We show how to solve such games when winning conditions are Boolean combinations of a Buchi condition and a new condition that we call unboundedness. An infinite play satisfies the unboundedness condition if there is no bound on the size of the stack during the play. We show that the problem of deciding a winner in such games is EXPTIME-complete

Topics: F.3.1, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL]
Publisher: Springer Verlag
Year: 2003
OAI identifier: oai:HAL:hal-00012141v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.