| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Uniformisation Gives the Full Strength of Regular Languages | Lhote, Nathan et al. | 2019 |
| 2 | How Deterministic are Good-For-Games Automata? | Boker, Udi et al. | 2018 |
| 3 | Unambiguous Languages Exhaust the Index Hierarchy | Skrzypczak, Michal | 2018 |
| 4 | A Characterisation of Pi^0_2 Regular Tree Languages | Cavallari, Filippo et al. | 2017 |
| 5 | Deciding the Topological Complexity of Büchi Languages | Skrzypczak, Michal et al. | 2016 |
| 6 | On the Complexity of Branching Games with Regular Conditions | Przybylko, Marcin et al. | 2016 |
| 7 | The Logical Strength of Büchi's Decidability Theorem | Kolodziejczyk, Leszek Aleksander et al. | 2016 |
| 8 | Regular languages of thin trees | Bojanczyk, Mikolaj et al. | 2013 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |