Showing cs.FLShow all
2 papers · 1 filter
cs.FL2020
Collapsible Pushdown Parity Games
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague +3
This paper studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely those generated by collapsible pushdown automata. The main mot…
cs.FL2018
Emptiness of Stack Automata is NEXPTIME-complete: A Correction
Christopher Broadbent, Arnaud Carayol, Matthew Hague +1
A saturation algorithm for collapsible pushdown systems was published in ICALP 2012. This work introduced a class of stack automata used to recognised regular sets of collapsible p…