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

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