| No. |
Title |
Author |
Year |
| 1 |
A Complexity Approach to Tree Algebras: the Polynomial Case |
Colcombet, Thomas et al. |
2022 |
| 2 |
On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games |
Casares, Antonio et al. |
2022 |
| 3 |
Unambiguity in Automata Theory (Dagstuhl Seminar 21452) |
Colcombet, Thomas et al. |
2022 |
| 4 |
A Complexity Approach to Tree Algebras: the Bounded Case |
Colcombet, Thomas et al. |
2021 |
| 5 |
Learning Automata and Transducers: A Categorical Approach |
Colcombet, Thomas et al. |
2021 |
| 6 |
Optimal Transformations of Games and Automata Using Muller Conditions |
Casares, Antonio et al. |
2021 |
| 7 |
Cost Automata, Safe Schemes, and Downward Closures |
Barozzini, David et al. |
2020 |
| 8 |
Unambiguous Separators for Tropical Tree Automata |
Colcombet, Thomas et al. |
2020 |
| 9 |
On Reachability Problems for Low-Dimensional Matrix Semigroups |
Colcombet, Thomas et al. |
2019 |
| 10 |
Automata in the Category of Glued Vector Spaces |
Colcombet, Thomas et al. |
2017 |
| 11 |
Automata Minimization: a Functorial Approach |
Colcombet, Thomas et al. |
2017 |
| 12 |
Cost Functions Definable by Min/Max Automata |
Colcombet, Thomas et al. |
2016 |
| 13 |
On a Fragment of AMSO and Tiling Systems |
Blumensath, Achim et al. |
2016 |
| 14 |
The Bridge Between Regular Cost Functions and Omega-Regular Languages |
Colcombet, Thomas et al. |
2016 |
| 15 |
Combinatorial Expressions and Lower Bounds |
Colcombet, Thomas et al. |
2015 |
| 16 |
Fragments of Fixpoint Logic on Data Words |
Colcombet, Thomas et al. |
2015 |
| 17 |
Generalized Data Automata and Fixpoint Logic |
Colcombet, Thomas et al. |
2014 |
| 18 |
Playing Safe |
Colcombet, Thomas et al. |
2014 |
| 19 |
Approximate comparison of distance automata |
Colcombet, Thomas et al. |
2013 |
| 20 |
Deciding the weak definability of Büchi definable tree languages |
Colcombet, Thomas et al. |
2013 |
| 21 |
Forms of Determinism for Automata (Invited Talk) |
Colcombet, Thomas |
2012 |
