The Complexity of Games on Higher Order Pushdown Automata

Details The Complexity of Games on Higher Order Pushdown Automata The Complexity of Games on Higher Order Pushdown Automata

2007-05-02

arxiv.org/abs/0705.0262v1

Computer Science

Computer Science and Game Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Games on Higher Order Pushdown Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Complexity of Games on Higher Order Pushdown Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Games on Higher Order Pushdown Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-674585