The Complexity of Well-Matched Regularity for Visibly Pushdown Languages
First-Order Definability of Regular Tree Languages
Asymptotic Hausdorff and Language Similarity
A Parameterized BüChi-Landweber Theorem
Type 2 Uncomputability, (Polynomial Functors) and Automata (!)
Multiplicity Equivalence of Context-Free Grammars
PTIME algorithm for parity games
