32 citations · 61 across the 17 of their papers we have counts for
Showing 2020 · cs.FLShow all
2 papers · 2 filters
cs.FL2020★ 1 cited
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.FL2020★ 5 cited
The Big-O Problem
Dmitry Chistikov, Stefan Kiefer, Andrzej S. Murawski +1
Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater than some constant m…