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


DROPS-Home | Fulltext Search | Imprint Published by LZI