| The uniform measure of simple regular sets of infinite trees | 0 | 0.34 | 2021 |
| On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words | 0 | 0.34 | 2021 |
| Uniformisations of Regular Relations Over Bi-Infinite Words | 0 | 0.34 | 2020 |
| On the Succinctness of Alternating Parity Good-for-Games Automata | 0 | 0.34 | 2020 |
| Regular Choice Functions and Uniformisations For countable Domains. | 0 | 0.34 | 2020 |
| Computing Measures of Weak-MSO Definable Sets of Trees. | 0 | 0.34 | 2020 |
| MSO+∇ is undecidable | 0 | 0.34 | 2019 |
| MSO+nabla is undecidable. | 0 | 0.34 | 2019 |
| Regular tree languages in low levels of the Wadge Hierarchy. | 0 | 0.34 | 2019 |
| Uniformisation Gives the Full Strength of Regular Languages. | 0 | 0.34 | 2019 |
| Büchi VASS Recognise ∑11-complete ω-languages. | 0 | 0.34 | 2018 |
| Monadic Second Order Logic with Measure and Category Quantifiers. | 1 | 0.37 | 2018 |
| Unambiguous languages exhaust the index hierarchy. | 0 | 0.34 | 2018 |
| On The Strength Of Unambiguous Tree Automata | 0 | 0.34 | 2018 |
| Measure properties of regular sets of trees. | 2 | 0.41 | 2017 |
| How Deterministic are Good-For-Games Automata? | 0 | 0.34 | 2017 |
| A Characterisation of Pi^0_2 Regular Tree Languages. | 0 | 0.34 | 2017 |
| On the Complexity of Branching Games with Regular Conditions. | 2 | 0.38 | 2016 |
| Regular Languages of Thin Trees | 0 | 0.34 | 2016 |
| The Logical Strength of Büchi's Decidability Theorem. | 0 | 0.34 | 2016 |
| Index problems for game automata | 0 | 0.34 | 2015 |
| On the Weak Index Problem for Game Automata | 1 | 0.35 | 2015 |
| Trading Bounds for Memory in Games with Counters | 0 | 0.34 | 2015 |
| On the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets. | 0 | 0.34 | 2014 |
| Unambiguous Buchi is weak. | 0 | 0.34 | 2014 |
| On the Decidability of MSO plus U on Infinite Trees | 5 | 0.54 | 2014 |
| Separation Property for wB- and wS-regular Languages. | 1 | 0.40 | 2014 |
| Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata | 8 | 0.69 | 2013 |
| Unambiguity and uniformization problems on infinite trees. | 3 | 0.42 | 2013 |
| Regular languages of thin trees. | 0 | 0.34 | 2013 |
| Equational theories of profinite structures | 0 | 0.34 | 2011 |
