Thomas Colcombet

Q: What Schools Are Affiliated With Thomas Colcombet

Thomas Colcombet is affiliated with the following schools: University of California, Berkeley, University of Rennes 1

Thomas Colcombet's AcademicInfluence.com Rankings

Thomas Colcombet

Computer Science

#9960

World Rank

#10448

Historical Rank

Theoretical Computer Science

#146

World Rank

#146

Historical Rank

Database

#9414

World Rank

#9917

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Thomas Colcombet Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Thomas Colcombet is a French theoretical computer scientist known for settling major open problems on tree walking automata jointly with Mikołaj Bojańczyk. Colcombet is currently a CNRS Research Director at Paris Diderot University.

(See a Problem?)

Thomas Colcombet's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Theory of Stabilisation Monoids and Regular Cost Functions (2009) (119)
Enforcing trace properties by program transformation (2000) (116)
Transforming structures by set interpretations (2007) (81)
Bounds in ω-regularity (75)
Bounds in w-Regularity (2006) (70)
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (2008) (66)
Regular Cost Functions over Finite Trees (2010) (59)
A Combinatorial Theorem for Trees (2007) (56)
Regular Cost Functions, Part I: Logic and Algebra over Words (2012) (55)
Tree-walking automata do not recognize all regular languages (2005) (52)
Unambiguity in Automata Theory (2015) (44)
Tree-Walking Automata Cannot Be Determinized (2006) (43)
On Families of Graphs Having a Decidable First Order Theory with Reachability (2002) (36)
The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem (2008) (34)
Logical theories and compatible operations (2007) (32)
The Complexity of Boundedness for Guarded Logics (2015) (30)
Green's Relations and Their Use in Automata Theory (2011) (29)
Factorisation Forests for Infinite Words (2007) (27)
Forms of Determinism for Automata (2012) (26)
Forms of Determinism for Automata (Invited Talk) (2012) (26)
Deciding the weak definability of Büchi definable tree languages (2013) (25)
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games (2019) (25)
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata (2009) (25)
On the positional determinacy of edge-labeled games (2006) (24)
Factorization forests for infinite words and applications to countable scattered linear orderings (2010) (24)
Size-Change Abstraction and Max-Plus Automata (2014) (23)
Regular Languages of Words over Countable Linear Orderings (2011) (21)
Generalized Data Automata and Fixpoint Logic (2014) (20)
On the Use of Guards for Logics with Data (2011) (16)
Perfect half space games (2017) (15)
Regular Temporal Cost Functions (2010) (15)
Rewriting in the partial algebra of typed terms modulo AC (2003) (13)
Two-way cost automata and cost logics over infinite trees (2014) (13)
Approximate comparison of distance automata (2013) (13)
Parity games and universal graphs (2018) (12)
A combinatorial theorem for trees applications to monadic logic and infinite structures (2007) (11)
On reachability problems for low dimensional matrix semigroups (2019) (11)
Optimal Transformations of Games and Automata Using Muller Conditions (2021) (10)
Automata Minimization: a Functorial Approach (2017) (10)
Logics with rigidly guarded data tests (2014) (9)
On the size of good-for-games Rabin automata and its link with the memory in Muller games (2022) (9)
On Equivalent Representations of Infinite Structures (2003) (9)
Factorisation forests for infinite words application to countable scattered linear orderings (2007) (8)
AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS (2017) (7)
The Bridge Between Regular Cost Functions and Omega-Regular Languages (2016) (7)
Limited Set quantifiers over Countable Linear Orderings (2015) (7)
Learning automata and transducers: a categorical approach (2020) (6)
Controlling a Random Population (2019) (5)
Asymptotic Monadic Second-Order Logic (2014) (5)
Cost Functions Definable by Min/Max Automata (2016) (5)
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory (2013) (5)
Approximate Comparison of Functions Computed by Distance Automata (2016) (5)
The Theory of Universal Graphs for Infinite Duration Games (2021) (5)
Safra-like constructions for regular cost functions over finite words (2011) (5)
Cost Automata, Safe Schemes, and Downward Closures (2020) (4)
Optimal transformations of Muller conditions (2020) (4)
Automata and Program Analysis (2017) (4)
Automata and minimization (2017) (4)
Composition with Algebra at the Background - On a Question by Gurevich and Rabinovich on the Monadic Theory of Linear Orderings (2013) (4)
Boundedness in languages of infinite words (2017) (4)
The factorisation forest theorem (2021) (4)
Games with bound guess actions (2016) (3)
A Complexity Approach to Tree Algebras: the Bounded Case (2021) (3)
On factorisation forests (2007) (3)
Automata in the Category of Glued Vector Spaces (2017) (3)
On the Expressiveness of Deterministic Transducers over Infinite Trees (2004) (3)
Logic and regular cost functions (2017) (3)
Fragments of Fixpoint Logic on Data Words (2015) (3)
Combinatorial Expressions and Lower Bounds (2015) (2)
On a Fragment of AMSO and Tiling Systems (2016) (2)
Cost functions with several order of magnitudes and the use of Relative Internal Set Theory (2013) (2)
First-order separation over countable ordinals (2022) (1)
Unambiguity in Automata Theory (Dagstuhl Seminar 21452) (2021) (1)
On Equivalent Representations of In nite Structures (2019) (1)
A Complexity Approach to Tree Algebras: the Polynomial Case (2022) (0)
Playing Safe, Ten Years Later (2022) (0)
Z-polyregular functions (2022) (0)
Approximate Comparison of Functions Computed by Distance Automata (2015) (0)
$μ$-calculus on Data Words (2014) (0)
er si on 1-1 7 Ja n 20 07 On factorisation forests And some applications (2007) (0)
Forms of Determinism for Automataú (2012) (0)
2 Combinatorial Expressions and Lower Bounds (2015) (0)
2 Cost Functions Definable by Min / Max Automata then (2016) (0)
Uniformization Results on Regular Cost Functions (2016) (0)
The monadic theory of linear orders: Invited Presentation at the Second International Symposium on Games, Automata, Logics and Formal Verification (2011) (0)
Unambiguous separators for tropical tree automata (2019) (0)
Playing Safe (2014) (0)
L O ] 18 A pr 2 01 4 μ-calculus on data words (2014) (0)
BOUNDEDNESS IN LANGUAGES OF INFINITE (2009) (0)
Boundedness problems in resource games, logics and automatic structures (2016) (0)

This paper list is powered by the following services:

Other Resources About Thomas Colcombet

What Schools Are Affiliated With Thomas Colcombet?

Thomas Colcombet is affiliated with the following schools:

Thomas Colcombet's Academic­Influence.com Rankings

Why Is Thomas Colcombet Influential?

Thomas Colcombet's Published Works

Published Works

Other Resources About Thomas Colcombet

What Schools Are Affiliated With Thomas Colcombet?

Thomas Colcombet's AcademicInfluence.com Rankings