35 citations · 151 across the 21 of their papers we have counts for
1 paper · 1 filter
Thierry Cachat, Igor Walukiewicz
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 up…