Thomas Colcombet

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 51

Top Topics

Regular Languages

Top Venues

Log. Methods Comput. Sci.

Publications

Thomas Colcombet, Amina Doumane, Denis Kuperberg
Tree algebras and bisimulation-invariant MSO on finite graphs. CoRR (2024)
Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
Playing Safe, Ten Years Later. Log. Methods Comput. Sci. 20 (1) (2024)
Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism. CoRR (2023)
Thomas Colcombet, Gaëtan Douéneau-Tabot, Aliaume Lopez
ℤ-polyregular functions. LICS (2023)
Thomas Colcombet, Sam van Gool, Rémi Morvan
First-order separation over countable ordinals. CoRR (2022)
Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
The Theory of Universal Graphs for Infinite Duration Games. Log. Methods Comput. Sci. 18 (3) (2022)
Thomas Colcombet, Gaëtan Douéneau-Tabot, Aliaume Lopez
Z-polyregular functions. CoRR (2022)
Thomas Colcombet, Sam van Gool, Rémi Morvan
First-order separation over countable ordinals. FoSSaCS (2022)
Thomas Colcombet, Arthur Jaquard
A Complexity Approach to Tree Algebras: the Polynomial Case. MFCS (2022)
Antonio Casares, Thomas Colcombet, Karoliina Lehtinen
On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games. ICALP (2022)
David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys
Cost Automata, Safe Schemes, and Downward Closures. Fundam. Informaticae 188 (3) (2022)
Antonio Casares, Thomas Colcombet, Karoliina Lehtinen
On the size of good-for-games Rabin automata and its link with the memory in Muller games. CoRR (2022)
Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
Playing Safe, Ten Years Later. CoRR (2022)
Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
Controlling a random population. Log. Methods Comput. Sci. 17 (4) (2021)
Thomas Colcombet, Daniela Petrisan, Riccardo Stabile
Learning Automata and Transducers: A Categorical Approach. CSL (2021)
Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow
Optimal Transformations of Games and Automata Using Muller Conditions. ICALP (2021)
Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
The Theory of Universal Graphs for Infinite Duration Games. CoRR (2021)
Thomas Colcombet, Arthur Jaquard
A Complexity Approach to Tree Algebras: the Bounded Case. ICALP (2021)
Thomas Colcombet, Karin Quaas, Michal Skrzypczak
Unambiguity in Automata Theory (Dagstuhl Seminar 21452). Dagstuhl Reports 11 (10) (2021)
Thomas Colcombet, Daniela Petrisan
Automata Minimization: a Functorial Approach. Log. Methods Comput. Sci. 16 (1) (2020)
Thomas Colcombet, Sylvain Lombardy
Unambiguous Separators for Tropical Tree Automata. STACS (2020)
David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys
Cost Automata, Safe Schemes, and Downward Closures. ICALP (2020)
Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow
Optimal transformations of Muller conditions. CoRR (2020)
David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys
Cost Automata, Safe Schemes, and Downward Closures. CoRR (2020)
Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
Controlling a Random Population. FoSSaCS (2020)
Thomas Colcombet, Daniela Petrisan, Riccardo Stabile
Learning automata and transducers: a categorical approach. CoRR (2020)
Thomas Colcombet, Nathanaël Fijalkow
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games. FoSSaCS (2019)
Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell
On reachability problems for low dimensional matrix semigroups. CoRR (2019)
Thomas Colcombet, Sylvain Lombardy
Unambiguous separators for tropical tree automata. CoRR (2019)
Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell
On Reachability Problems for Low-Dimensional Matrix Semigroups. ICALP (2019)
Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
Controlling a random population. CoRR (2019)
Olivier Carton, Thomas Colcombet, Gabriele Puppis
An Algebraic Approach to MSO-Definability on Countable linear Orderings. J. Symb. Log. 83 (3) (2018)
Thomas Colcombet, Nathanaël Fijalkow
Parity games and universal graphs. CoRR (2018)
Thomas Colcombet, Daniela Petrisan
Automata in the Category of Glued Vector Spaces. CoRR (2017)
Thomas Colcombet, Laure Daviaud, Florian Zuleger
Automata and Program Analysis. FCT (2017)
Thomas Colcombet, Daniela Petrisan
Automata in the Category of Glued Vector Spaces. MFCS (2017)
Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
Perfect half space games. LICS (2017)
Thomas Colcombet, Daniela Petrisan
Automata Minimization: a Functorial Approach. CoRR (2017)
Thomas Colcombet, Daniela Petrisan
Automata Minimization: a Functorial Approach. CALCO (2017)
Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz
Perfect Half Space Games. CoRR (2017)
Thomas Colcombet, Daniela Petrisan
Automata Minimization: a Functorial Approach. CoRR (2017)
Thomas Colcombet, Daniela Petrisan
Automata and minimization. ACM SIGLOG News 4 (2) (2017)
Mikolaj Bojanczyk, Thomas Colcombet
Boundedness in languages of infinite words. Log. Methods Comput. Sci. 13 (4) (2017)
Olivier Carton, Thomas Colcombet, Gabriele Puppis
Regular Languages of Words over Countable Linear Orderings. CoRR (2017)
Thomas Colcombet
Logic and regular cost functions. LICS (2017)
Mikolaj Bojanczyk, Thomas Colcombet
Boundedness in languages of infinite words. CoRR (2017)
Thomas Colcombet, Laure Daviaud
Approximate Comparison of Functions Computed by Distance Automata. Theory Comput. Syst. 58 (4) (2016)
Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk
Cost Functions Definable by Min/Max Automata. STACS (2016)
Thomas Colcombet, Nathanaël Fijalkow
The Bridge Between Regular Cost Functions and Omega-Regular Languages. ICALP (2016)
Thomas Colcombet, Stefan Göller
Games with bound guess actions. LICS (2016)
Achim Blumensath, Thomas Colcombet, Pawel Parys
On a Fragment of AMSO and Tiling Systems. STACS (2016)
Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom
The Complexity of Boundedness for Guarded Logics. LICS (2015)
Thomas Colcombet, Amaldev Manuel
Fragments of Fixpoint Logic on Data Words. FSTTCS (2015)
Thomas Colcombet, Amaldev Manuel
Combinatorial Expressions and Lower Bounds. STACS (2015)
Thomas Colcombet, Clemens Ley, Gabriele Puppis
Logics with rigidly guarded data tests. Log. Methods Comput. Sci. 11 (3) (2015)
Thomas Colcombet
Unambiguity in Automata Theory. DCFS (2015)
Thomas Colcombet, A. V. Sreejith
Limited Set quantifiers over Countable Linear Orderings. ICALP (2) (2015)
Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
Playing Safe. FSTTCS (2014)
Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom
Two-way cost automata and cost logics over infinite trees. CSL-LICS (2014)
Achim Blumensath, Olivier Carton, Thomas Colcombet
Asymptotic Monadic Second-Order Logic. MFCS (1) (2014)
Thomas Colcombet, Laure Daviaud, Florian Zuleger
Size-Change Abstraction and Max-Plus Automata. MFCS (1) (2014)
Thomas Colcombet, Amaldev Manuel
Generalized Data Automata and Fixpoint Logic. FSTTCS (2014)
Thomas Colcombet, Amaldev Manuel
$μ$-calculus on data words. CoRR (2014)
Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom
Deciding the weak definability of Büchi definable tree languages. CSL (2013)
Thomas Colcombet
Composition with Algebra at the Background - On a Question by Gurevich and Rabinovich on the Monadic Theory of Linear Orderings. CSR (2013)
Thomas Colcombet, Laure Daviaud
Approximate comparison of distance automata. STACS (2013)
Thomas Colcombet
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory. LICS (2013)
Thomas Colcombet
Regular Cost Functions, Part I: Logic and Algebra over Words Log. Methods Comput. Sci. 9 (3) (2013)
Thomas Colcombet
Forms of Determinism for Automata (Invited Talk). STACS (2012)
Thomas Colcombet
Green's Relations and Their Use in Automata Theory. LATA (2011)
Thomas Colcombet, Clemens Ley, Gabriele Puppis
On the Use of Guards for Logics with Data. MFCS (2011)
Olivier Carton, Thomas Colcombet, Gabriele Puppis
Regular Languages of Words over Countable Linear Orderings. ICALP (2) (2011)
Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy
Regular Temporal Cost Functions. ICALP (2) (2010)
Thomas Colcombet
Factorization forests for infinite words and applications to countable scattered linear orderings. Theor. Comput. Sci. 411 (4-5) (2010)
Thomas Colcombet, Christof Löding
Regular Cost Functions over Finite Trees. LICS (2010)
Thomas Colcombet, Konrad Zdanowski
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata. ICALP (2) (2009)
Thomas Colcombet
The Theory of Stabilisation Monoids and Regular Cost Functions. ICALP (2) (2009)
Mikolaj Bojanczyk, Thomas Colcombet
Tree-Walking Automata Do Not Recognize All Regular Languages. SIAM J. Comput. 38 (2) (2008)
Thomas Colcombet, Christof Löding
The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. CSL (2008)
Achim Blumensath, Thomas Colcombet, Christof Löding
Logical theories and compatible operations. Logic and Automata (2008)
Thomas Colcombet, Christof Löding
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. ICALP (2) (2008)
Thomas Colcombet
On factorisation forests CoRR (2007)
Thomas Colcombet, Christof Löding
Transforming structures by set interpretations. Log. Methods Comput. Sci. 3 (2) (2007)
Thomas Colcombet
Factorisation Forests for Infinite Words. FCT (2007)
Thomas Colcombet, Christof Löding
Transforming structures by set interpretations CoRR (2007)
Thomas Colcombet
A Combinatorial Theorem for Trees. ICALP (2007)
Mikolaj Bojanczyk, Thomas Colcombet
Tree-walking automata cannot be determinized. Theor. Comput. Sci. 350 (2-3) (2006)
Thomas Colcombet, Damian Niwinski
On the positional determinacy of edge-labeled games. Theor. Comput. Sci. 352 (1-3) (2006)
Mikolaj Bojanczyk, Thomas Colcombet
Bounds in w-Regularity. LICS (2006)
Mikolaj Bojanczyk, Thomas Colcombet
Tree-walking automata do not recognize all regular languages. STOC (2005)
Thomas Colcombet, Christof Löding
On the Expressiveness of Deterministic Transducers over Infinite Trees. STACS (2004)
Mikolaj Bojanczyk, Thomas Colcombet
Tree-Walking Automata Cannot Be Determinized. ICALP (2004)
Arnaud Carayol, Thomas Colcombet
On Equivalent Representations of Infinite Structures. ICALP (2003)
Thomas Colcombet
Rewriting in the partial algebra of typed terms modulo AC. INFINITY (2002)
Thomas Colcombet
On Families of Graphs Having a Decidable First Order Theory with Reachability. ICALP (2002)
Thomas Colcombet, Pascal Fradet
Enforcing Trace Properties by Program Transformation. POPL (2000)