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