32 citations · 61 across the 17 of their papers we have counts for
3 papers · 1 filter
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…
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…
Bisimilarity in fresh-register automata
Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos
Register automata are a basic model of computation over infinite alphabets. Fresh-register automata extend register automata with the capability to generate fresh symbols in order…