default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Colcombet
Person information
- affiliation: Paris-Diderot, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe, Ten Years Later. Log. Methods Comput. Sci. 20(1) (2024)- [j16]Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen:
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism. TheoretiCS 3 (2024) - [i24]Thomas Colcombet, Amina Doumane, Denis Kuperberg:
Tree algebras and bisimulation-invariant MSO on finite graphs. CoRR abs/2407.12677 (2024) - 2023
- [c56]Thomas Colcombet
, Gaëtan Douéneau-Tabot, Aliaume Lopez:
ℤ-polyregular functions. LICS 2023: 1-13 - [i23]Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen:
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism. CoRR abs/2305.04323 (2023) - 2022
- [j15]David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys:
Cost Automata, Safe Schemes, and Downward Closures. Fundam. Informaticae 188(3): 127-178 (2022) - [j14]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) - [c55]Thomas Colcombet, Sam van Gool, Rémi Morvan:
First-order separation over countable ordinals. FoSSaCS 2022: 264-284 - [c54]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: 117:1-117:20 - [c53]Thomas Colcombet, Arthur Jaquard:
A Complexity Approach to Tree Algebras: the Polynomial Case. MFCS 2022: 37:1-37:14 - [i22]Thomas Colcombet, Sam van Gool, Rémi Morvan:
First-order separation over countable ordinals. CoRR abs/2201.03089 (2022) - [i21]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 abs/2204.11333 (2022) - [i20]Thomas Colcombet, Gaëtan Douéneau-Tabot, Aliaume Lopez:
Z-polyregular functions. CoRR abs/2207.07450 (2022) - [i19]Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe, Ten Years Later. CoRR abs/2212.12024 (2022) - 2021
- [j13]Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann:
Controlling a random population. Log. Methods Comput. Sci. 17(4) (2021) - [c52]Thomas Colcombet, Daniela Petrisan, Riccardo Stabile:
Learning Automata and Transducers: A Categorical Approach. CSL 2021: 15:1-15:17 - [c51]Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow:
Optimal Transformations of Games and Automata Using Muller Conditions. ICALP 2021: 123:1-123:14 - [c50]Thomas Colcombet, Arthur Jaquard:
A Complexity Approach to Tree Algebras: the Bounded Case. ICALP 2021: 127:1-127:13 - [p1]Thomas Colcombet:
The factorisation forest theorem. Handbook of Automata Theory (I.) 2021: 653-693 - [i18]Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
The Theory of Universal Graphs for Infinite Duration Games. CoRR abs/2104.05262 (2021) - [i17]Thomas Colcombet, Karin Quaas, Michal Skrzypczak:
Unambiguity in Automata Theory (Dagstuhl Seminar 21452). Dagstuhl Reports 11(10): 57-71 (2021) - 2020
- [j12]Thomas Colcombet, Daniela Petrisan:
Automata Minimization: a Functorial Approach. Log. Methods Comput. Sci. 16(1) (2020) - [c49]Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann:
Controlling a Random Population. FoSSaCS 2020: 119-135 - [c48]David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys:
Cost Automata, Safe Schemes, and Downward Closures. ICALP 2020: 109:1-109:18 - [c47]Thomas Colcombet, Sylvain Lombardy:
Unambiguous Separators for Tropical Tree Automata. STACS 2020: 32:1-32:13 - [i16]David Barozzini, Lorenzo Clemente, Thomas Colcombet, Pawel Parys:
Cost Automata, Safe Schemes, and Downward Closures. CoRR abs/2004.12187 (2020) - [i15]Thomas Colcombet, Daniela Petrisan, Riccardo Stabile:
Learning automata and transducers: a categorical approach. CoRR abs/2010.13675 (2020) - [i14]Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow:
Optimal transformations of Muller conditions. CoRR abs/2011.13041 (2020)
2010 – 2019
- 2019
- [c46]Thomas Colcombet, Nathanaël Fijalkow:
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games. FoSSaCS 2019: 1-26 - [c45]Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell:
On Reachability Problems for Low-Dimensional Matrix Semigroups. ICALP 2019: 44:1-44:15 - [i13]Thomas Colcombet, Joël Ouaknine, Pavel Semukhin, James Worrell:
On reachability problems for low dimensional matrix semigroups. CoRR abs/1902.09597 (2019) - [i12]Thomas Colcombet, Sylvain Lombardy:
Unambiguous separators for tropical tree automata. CoRR abs/1910.02164 (2019) - [i11]Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann:
Controlling a random population. CoRR abs/1911.01195 (2019) - 2018
- [j11]Olivier Carton, Thomas Colcombet, Gabriele Puppis:
An Algebraic Approach to MSO-Definability on Countable linear Orderings. J. Symb. Log. 83(3): 1147-1189 (2018) - [i10]Thomas Colcombet, Nathanaël Fijalkow:
Parity games and universal graphs. CoRR abs/1810.05106 (2018) - 2017
- [j10]Mikolaj Bojanczyk, Thomas Colcombet:
Boundedness in languages of infinite words. Log. Methods Comput. Sci. 13(4) (2017) - [j9]Thomas Colcombet, Daniela Petrisan:
Automata and minimization. ACM SIGLOG News 4(2): 4-27 (2017) - [c44]Thomas Colcombet, Daniela Petrisan:
Automata Minimization: a Functorial Approach. CALCO 2017: 8:1-8:16 - [c43]Thomas Colcombet, Laure Daviaud, Florian Zuleger:
Automata and Program Analysis. FCT 2017: 3-10 - [c42]Thomas Colcombet:
Logic and regular cost functions. LICS 2017: 1-4 - [c41]Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Perfect half space games. LICS 2017: 1-11 - [c40]Thomas Colcombet, Daniela Petrisan:
Automata in the Category of Glued Vector Spaces. MFCS 2017: 52:1-52:14 - [i9]Olivier Carton, Thomas Colcombet, Gabriele Puppis:
Regular Languages of Words over Countable Linear Orderings. CoRR abs/1702.05342 (2017) - [i8]Thomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz:
Perfect Half Space Games. CoRR abs/1704.05626 (2017) - [i7]Mikolaj Bojanczyk, Thomas Colcombet:
Boundedness in languages of infinite words. CoRR abs/1708.09765 (2017) - [i6]Thomas Colcombet, Daniela Petrisan:
Automata Minimization: a Functorial Approach. CoRR abs/1711.03063 (2017) - [i5]Thomas Colcombet, Daniela Petrisan:
Automata in the Category of Glued Vector Spaces. CoRR abs/1711.06065 (2017) - [i4]Thomas Colcombet, Daniela Petrisan:
Automata Minimization: a Functorial Approach. CoRR abs/1712.07121 (2017) - 2016
- [j8]Thomas Colcombet, Laure Daviaud:
Approximate Comparison of Functions Computed by Distance Automata. Theory Comput. Syst. 58(4): 579-613 (2016) - [c39]Thomas Colcombet, Nathanaël Fijalkow:
The Bridge Between Regular Cost Functions and Omega-Regular Languages. ICALP 2016: 126:1-126:13 - [c38]Thomas Colcombet, Stefan Göller:
Games with bound guess actions. LICS 2016: 257-266 - [c37]Achim Blumensath, Thomas Colcombet, Pawel Parys:
On a Fragment of AMSO and Tiling Systems. STACS 2016: 19:1-19:14 - [c36]Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk:
Cost Functions Definable by Min/Max Automata. STACS 2016: 29:1-29:13 - 2015
- [j7]Thomas Colcombet, Clemens Ley, Gabriele Puppis:
Logics with rigidly guarded data tests. Log. Methods Comput. Sci. 11(3) (2015) - [c35]Thomas Colcombet:
Unambiguity in Automata Theory. DCFS 2015: 3-18 - [c34]Thomas Colcombet, Amaldev Manuel:
Fragments of Fixpoint Logic on Data Words. FSTTCS 2015: 98-111 - [c33]Thomas Colcombet, A. V. Sreejith:
Limited Set quantifiers over Countable Linear Orderings. ICALP (2) 2015: 146-158 - [c32]Michael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom:
The Complexity of Boundedness for Guarded Logics. LICS 2015: 293-304 - [c31]Thomas Colcombet, Amaldev Manuel:
Combinatorial Expressions and Lower Bounds. STACS 2015: 249-261 - 2014
- [c30]Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom:
Two-way cost automata and cost logics over infinite trees. CSL-LICS 2014: 16:1-16:9 - [c29]Thomas Colcombet, Amaldev Manuel:
Generalized Data Automata and Fixpoint Logic. FSTTCS 2014: 267-278 - [c28]Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe. FSTTCS 2014: 379-390 - [c27]Achim Blumensath, Olivier Carton, Thomas Colcombet:
Asymptotic Monadic Second-Order Logic. MFCS (1) 2014: 87-98 - [c26]Thomas Colcombet, Laure Daviaud, Florian Zuleger:
Size-Change Abstraction and Max-Plus Automata. MFCS (1) 2014: 208-219 - [i3]Thomas Colcombet, Amaldev Manuel:
$μ$-calculus on data words. CoRR abs/1404.4827 (2014) - 2013
- [j6]Thomas Colcombet:
Regular Cost Functions, Part I: Logic and Algebra over Words. Log. Methods Comput. Sci. 9(3) (2013) - [c25]Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom:
Deciding the weak definability of Büchi definable tree languages. CSL 2013: 215-230 - [c24]Thomas Colcombet:
Composition with Algebra at the Background - On a Question by Gurevich and Rabinovich on the Monadic Theory of Linear Orderings. CSR 2013: 391-404 - [c23]Thomas Colcombet:
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory. LICS 2013: 123 - [c22]Thomas Colcombet, Laure Daviaud:
Approximate comparison of distance automata. STACS 2013: 574-585 - 2012
- [c21]Thomas Colcombet:
Forms of Determinism for Automata (Invited Talk). STACS 2012: 1-23 - 2011
- [c20]Olivier Carton, Thomas Colcombet, Gabriele Puppis:
Regular Languages of Words over Countable Linear Orderings. ICALP (2) 2011: 125-136 - [c19]Thomas Colcombet:
Green's Relations and Their Use in Automata Theory. LATA 2011: 1-21 - [c18]Thomas Colcombet, Clemens Ley, Gabriele Puppis:
On the Use of Guards for Logics with Data. MFCS 2011: 243-255 - 2010
- [j5]Thomas Colcombet:
Factorization forests for infinite words and applications to countable scattered linear orderings. Theor. Comput. Sci. 411(4-5): 751-764 (2010) - [c17]Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy:
Regular Temporal Cost Functions. ICALP (2) 2010: 563-574 - [c16]Thomas Colcombet, Christof Löding:
Regular Cost Functions over Finite Trees. LICS 2010: 70-79
2000 – 2009
- 2009
- [c15]Thomas Colcombet:
The Theory of Stabilisation Monoids and Regular Cost Functions. ICALP (2) 2009: 139-150 - [c14]Thomas Colcombet, Konrad Zdanowski:
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata. ICALP (2) 2009: 151-162 - 2008
- [j4]Mikolaj Bojanczyk, Thomas Colcombet:
Tree-Walking Automata Do Not Recognize All Regular Languages. SIAM J. Comput. 38(2): 658-701 (2008) - [c13]Achim Blumensath, Thomas Colcombet, Christof Löding:
Logical theories and compatible operations. Logic and Automata 2008: 73-106 - [c12]Thomas Colcombet, Christof Löding:
The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. CSL 2008: 416-430 - [c11]Thomas Colcombet, Christof Löding:
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. ICALP (2) 2008: 398-409 - 2007
- [j3]Thomas Colcombet, Christof Löding:
Transforming structures by set interpretations. Log. Methods Comput. Sci. 3(2) (2007) - [c10]Thomas Colcombet:
Factorisation Forests for Infinite Words. FCT 2007: 226-237 - [c9]Thomas Colcombet:
A Combinatorial Theorem for Trees. ICALP 2007: 901-912 - [i2]Thomas Colcombet:
On factorisation forests. CoRR abs/cs/0701113 (2007) - [i1]Thomas Colcombet, Christof Löding:
Transforming structures by set interpretations. CoRR abs/cs/0703039 (2007) - 2006
- [j2]Mikolaj Bojanczyk, Thomas Colcombet:
Tree-walking automata cannot be determinized. Theor. Comput. Sci. 350(2-3): 164-173 (2006) - [j1]Thomas Colcombet, Damian Niwinski:
On the positional determinacy of edge-labeled games. Theor. Comput. Sci. 352(1-3): 190-196 (2006) - [c8]Mikolaj Bojanczyk, Thomas Colcombet:
Bounds in w-Regularity. LICS 2006: 285-296 - 2005
- [c7]Mikolaj Bojanczyk, Thomas Colcombet:
Tree-walking automata do not recognize all regular languages. STOC 2005: 234-243 - 2004
- [b1]Thomas Colcombet:
Représentations et propriétés de structures infinies. (Representations and properties of infinite structures). University of Rennes 1, France, 2004 - [c6]Mikolaj Bojanczyk, Thomas Colcombet:
Tree-Walking Automata Cannot Be Determinized. ICALP 2004: 246-256 - [c5]Thomas Colcombet, Christof Löding:
On the Expressiveness of Deterministic Transducers over Infinite Trees. STACS 2004: 428-439 - 2003
- [c4]Arnaud Carayol, Thomas Colcombet:
On Equivalent Representations of Infinite Structures. ICALP 2003: 599-610 - 2002
- [c3]Thomas Colcombet:
On Families of Graphs Having a Decidable First Order Theory with Reachability. ICALP 2002: 98-109 - [c2]Thomas Colcombet:
Rewriting in the partial algebra of typed terms modulo AC. INFINITY 2002: 40-54 - 2000
- [c1]Thomas Colcombet, Pascal Fradet:
Enforcing Trace Properties by Program Transformation. POPL 2000: 54-66
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 23:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
