19 citations · 44 across the 18 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LO2018★ 1 cited
Recursion Schemes, the MSO Logic, and the U quantifier
Paweł Parys
We study the model-checking problem for recursion schemes: does the tree generated by a given higher-order recursion scheme satisfy a given logical sentence. The problem is known t…
cs.FL2018★ 19 cited
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
Wojciech Czerwiński, Laure Daviaud, Nathanaël Fijalkow +3
Several distinct techniques have been proposed to design quasi-polynomial algorithms for solving parity games since the breakthrough result of Calude, Jain, Khoussainov, Li, and St…