Enforcing Trace Properties by Program Transformation. - Thomas Colcombet; Pascal Fradet (POPL, 2000)

On Families of Graphs Having a Decidable First Order Theory with Reachability. - Thomas Colcombet (ICALP, 2002)

Rewriting in the partial algebra of typed terms modulo AC. - Thomas Colcombet (INFINITY, 2002)

On Equivalent Representations of Infinite Structures. - Arnaud Carayol; Thomas Colcombet (ICALP, 2003)

On the Expressiveness of Deterministic Transducers over Infinite Trees. - Thomas Colcombet; Christof Löding (STACS, 2004)

Représentations et propriétés de structures infinies. (Representations and properties of infinite structures). - Thomas Colcombet (2004)

Bounds in w-Regularity. - Mikolaj Bojanczyk; Thomas Colcombet (LICS, 2006)

Tree-walking automata cannot be determinized. - Mikolaj Bojanczyk; Thomas Colcombet (Theor. Comput. Sci., 2006)

On the positional determinacy of edge-labeled games. - Thomas Colcombet; Damian Niwinski (Theor. Comput. Sci., 2006)

Factorisation Forests for Infinite Words. - Thomas Colcombet (FCT, 2007)

A Combinatorial Theorem for Trees. - Thomas Colcombet (ICALP, 2007)

On factorisation forests - Thomas Colcombet (CoRR, 2007)

Transforming structures by set interpretations. - Thomas Colcombet; Christof Löding (Log. Methods Comput. Sci., 2007)

Logical theories and compatible operations. - Achim Blumensath; Thomas Colcombet; Christof Löding (Logic and Automata, 2008)

The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. - Thomas Colcombet; Christof Löding (CSL, 2008)

The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. - Thomas Colcombet; Christof Löding (ICALP (2), 2008)

Tree-Walking Automata Do Not Recognize All Regular Languages. - Mikolaj Bojanczyk; Thomas Colcombet (SIAM J. Comput., 2008)

The Theory of Stabilisation Monoids and Regular Cost Functions. - Thomas Colcombet (ICALP (2), 2009)

A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata. - Thomas Colcombet; Konrad Zdanowski (ICALP (2), 2009)

Regular Temporal Cost Functions. - Thomas Colcombet; Denis Kuperberg; Sylvain Lombardy (ICALP (2), 2010)

Regular Cost Functions over Finite Trees. - Thomas Colcombet; Christof Löding (LICS, 2010)

Factorization forests for infinite words and applications to countable scattered linear orderings. - Thomas Colcombet (Theor. Comput. Sci., 2010)

Regular Languages of Words over Countable Linear Orderings. - Olivier Carton; Thomas Colcombet; Gabriele Puppis (ICALP (2), 2011)

Green's Relations and Their Use in Automata Theory. - Thomas Colcombet (LATA, 2011)

On the Use of Guards for Logics with Data. - Thomas Colcombet; Clemens Ley; Gabriele Puppis (MFCS, 2011)

Forms of Determinism for Automata (Invited Talk). - Thomas Colcombet (STACS, 2012)

Deciding the weak definability of Büchi definable tree languages. - Thomas Colcombet; Denis Kuperberg; Christof Löding; Michael Vanden Boom (CSL, 2013)

Composition with Algebra at the Background - On a Question by Gurevich and Rabinovich on the Monadic Theory of Linear Orderings. - Thomas Colcombet (CSR, 2013)

Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory. - Thomas Colcombet (LICS, 2013)

Approximate comparison of distance automata. - Thomas Colcombet; Laure Daviaud (STACS, 2013)

Regular Cost Functions, Part I: Logic and Algebra over Words - Thomas Colcombet (Log. Methods Comput. Sci., 2013)

Two-way cost automata and cost logics over infinite trees. - Achim Blumensath; Thomas Colcombet; Denis Kuperberg; Pawel Parys; Michael Vanden Boom (CSL-LICS, 2014)

Playing Safe. - Thomas Colcombet; Nathanaël Fijalkow; Florian Horn 001 (FSTTCS, 2014)

Generalized Data Automata and Fixpoint Logic. - Thomas Colcombet; Amaldev Manuel (FSTTCS, 2014)

Asymptotic Monadic Second-Order Logic. - Achim Blumensath; Olivier Carton; Thomas Colcombet (MFCS (1), 2014)

Size-Change Abstraction and Max-Plus Automata. - Thomas Colcombet; Laure Daviaud; Florian Zuleger (MFCS (1), 2014)

$μ$-calculus on data words. - Thomas Colcombet; Amaldev Manuel (CoRR, 2014)

Unambiguity in Automata Theory. - Thomas Colcombet (DCFS, 2015)

Fragments of Fixpoint Logic on Data Words. - Thomas Colcombet; Amaldev Manuel (FSTTCS, 2015)

Limited Set quantifiers over Countable Linear Orderings. - Thomas Colcombet; A. V. Sreejith (ICALP (2), 2015)

The Complexity of Boundedness for Guarded Logics. - Michael Benedikt; Balder ten Cate; Thomas Colcombet; Michael Vanden Boom (LICS, 2015)

Combinatorial Expressions and Lower Bounds. - Thomas Colcombet; Amaldev Manuel (STACS, 2015)

Logics with rigidly guarded data tests. - Thomas Colcombet; Clemens Ley; Gabriele Puppis (Log. Methods Comput. Sci., 2015)

The Bridge Between Regular Cost Functions and Omega-Regular Languages. - Thomas Colcombet; Nathanaël Fijalkow (ICALP, 2016)

Games with bound guess actions. - Thomas Colcombet; Stefan Göller (LICS, 2016)

On a Fragment of AMSO and Tiling Systems. - Achim Blumensath; Thomas Colcombet; Pawel Parys (STACS, 2016)

Cost Functions Definable by Min/Max Automata. - Thomas Colcombet; Denis Kuperberg; Amaldev Manuel; Szymon Torunczyk (STACS, 2016)

Approximate Comparison of Functions Computed by Distance Automata. - Thomas Colcombet; Laure Daviaud (Theory Comput. Syst., 2016)

Automata and Program Analysis. - Thomas Colcombet; Laure Daviaud; Florian Zuleger (FCT, 2017)

Logic and regular cost functions. - Thomas Colcombet (LICS, 2017)

Perfect half space games. - Thomas Colcombet; Marcin Jurdzinski; Ranko Lazic 001; Sylvain Schmitz (LICS, 2017)

Automata in the Category of Glued Vector Spaces. - Thomas Colcombet; Daniela Petrisan (MFCS, 2017)

Boundedness in languages of infinite words. - Mikolaj Bojanczyk; Thomas Colcombet (Log. Methods Comput. Sci., 2017)

Automata and minimization. - Thomas Colcombet; Daniela Petrisan (ACM SIGLOG News, 2017)

Parity games and universal graphs. - Thomas Colcombet; Nathanaël Fijalkow (CoRR, 2018)

An Algebraic Approach to MSO-Definability on Countable linear Orderings. - Olivier Carton; Thomas Colcombet; Gabriele Puppis (J. Symb. Log., 2018)

Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games. - Thomas Colcombet; Nathanaël Fijalkow (FoSSaCS, 2019)

On Reachability Problems for Low-Dimensional Matrix Semigroups. - Thomas Colcombet; Joël Ouaknine; Pavel Semukhin; James Worrell 001 (ICALP, 2019)

Unambiguous Separators for Tropical Tree Automata. - Thomas Colcombet; Sylvain Lombardy (STACS, 2020)

Optimal transformations of Muller conditions. - Antonio Casares; Thomas Colcombet; Nathanaël Fijalkow (CoRR, 2020)

Automata Minimization: a Functorial Approach. - Thomas Colcombet; Daniela Petrisan (Log. Methods Comput. Sci., 2020)

The factorisation forest theorem. - Thomas Colcombet (Handbook of Automata Theory (I.), 2021)

Learning Automata and Transducers: A Categorical Approach. - Thomas Colcombet; Daniela Petrisan; Riccardo Stabile (CSL, 2021)

Optimal Transformations of Games and Automata Using Muller Conditions. - Antonio Casares; Thomas Colcombet; Nathanaël Fijalkow (ICALP, 2021)

A Complexity Approach to Tree Algebras: the Bounded Case. - Thomas Colcombet; Arthur Jaquard (ICALP, 2021)

Unambiguity in Automata Theory (Dagstuhl Seminar 21452). - Thomas Colcombet; Karin Quaas; Michal Skrzypczak (Dagstuhl Reports, 2021)

Controlling a random population. - Thomas Colcombet; Nathanaël Fijalkow; Pierre Ohlmann (Log. Methods Comput. Sci., 2021)

First-order separation over countable ordinals. - Thomas Colcombet; Sam van Gool; Rémi Morvan (FoSSaCS, 2022)

On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games. - Antonio Casares; Thomas Colcombet; Karoliina Lehtinen (ICALP, 2022)

A Complexity Approach to Tree Algebras: the Polynomial Case. - Thomas Colcombet; Arthur Jaquard (MFCS, 2022)

Cost Automata, Safe Schemes, and Downward Closures. - David Barozzini; Lorenzo Clemente; Thomas Colcombet; Pawel Parys (Fundam. Informaticae, 2022)

The Theory of Universal Graphs for Infinite Duration Games. - Thomas Colcombet; Nathanaël Fijalkow; Pawel Gawrychowski; Pierre Ohlmann (Log. Methods Comput. Sci., 2022)

ℤ-polyregular functions. - Thomas Colcombet; Gaëtan Douéneau-Tabot; Aliaume Lopez (LICS, 2023)

Playing Safe, Ten Years Later. - Thomas Colcombet; Nathanaël Fijalkow; Florian Horn 001 (Log. Methods Comput. Sci., 2024)

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism. - Antonio Casares; Thomas Colcombet; Nathanaël Fijalkow; Karoliina Lehtinen (TheoretiCS, 2024)

On the Expansion of Monadic Second-Order Logic with Cantor-Bendixson Rank and Order Type Predicates. - Thomas Colcombet; Alexander Rabinovich (CSL, 2025)

Tree Algebras and Bisimulation-Invariant MSO on Finite Graphs. - Thomas Colcombet; Amina Doumane; Denis Kuperberg (ICALP, 2025)

Lambdas, Transducers and MSO (Invited Talk). - Thomas Colcombet (MFCS, 2025)

Regular expressions over countable words. - Thomas Colcombet; A. V. Sreejith (CoRR, 2025)