The Complexity of Games on Higher Order Pushdown Automata
Computer Science and Game Theory
2007-05-23 v1
Abstract
We prove an n-EXPTIME lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches the known upper bound for parity games on HPDA. As a consequence the mu-calculus model checking over graphs given by n-HPDA is n-EXPTIME complete.
Cite
@article{arxiv.0705.0262,
title = {The Complexity of Games on Higher Order Pushdown Automata},
author = {Thierry Cachat and Igor Walukiewicz},
journal= {arXiv preprint arXiv:0705.0262},
year = {2007}
}