@inbook{3afb99c332a74f34a7d4e12204de4a4c,
title = "Pushdown games with unboundedness and regular conditions",
abstract = "We 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 B{\"u}chi 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.",
author = "Bouquet, \{Alexis Julien\} and Oliver Serre and Igor Walukiewicz",
year = "2003",
month = jan,
day = "1",
doi = "10.1007/978-3-540-24597-1\_8",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "88--99",
editor = "Pandya, \{Paritosh K.\} and Jaikumar Radhakrishnan",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
}