No. Title Author Year
1 A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation Arnold, André et al. 2021
2 On Guidable Index of Tree Automata Niwiński, Damian et al. 2021
3 Computing Measures of Weak-MSO Definable Sets of Trees Niwiński, Damian et al. 2020
4 The Ackermann Award 2013 Dawar, Anuj et al. 2013
5 On the separation question for tree languages Arnold, André et al. 2012
6 The Ackermann Award 2012 Coquand, Thierry et al. 2012
7 On the Borel Inseparability of Game Tree Languages Hummel, Szczepan et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 7

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI