No. Title Author Year
1 Cyclic Proofs and Jumping Automata Kuperberg, Denis et al. 2019
2 Büchi Good-for-Games Automata Are Efficiently Recognizable Bagnol, Marc et al. 2018
3 Width of Non-deterministic Automata Kuperberg, Denis et al. 2018
4 Cost Functions Definable by Min/Max Automata Colcombet, Thomas et al. 2016
5 Soundness in Negotiations Esparza, Javier et al. 2016
6 Varieties of Cost Functions Daviaud, Laure et al. 2016
7 The Sensing Cost of Monitoring and Synthesis Almagor, Shaull et al. 2015
8 Regular Sensing Almagor, Shaull et al. 2014
9 Deciding the weak definability of Büchi definable tree languages Colcombet, Thomas et al. 2013
10 Linear temporal logic for regular cost functions Kuperberg, Denis 2011
11 Quasi-Weak Cost Automata: A New Variant of Weakness Kuperberg, Denis et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 11


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