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

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