bibliographer - Thomas Colcombet

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

Expregular functions Thomas Colcombet Nathan Lhote Pierre Ohlmann [github]

On the Expansion of Monadic Second-Order Logic with Cantor-Bendixson Rank and Order Type Predicates Thomas Colcombet Alexander Rabinovich [github]

Tree algebras and bisimulation-invariant MSO on finite graphs Thomas Colcombet Amina Doumane Denis Kuperberg [github]

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism Antonio Casares Thomas Colcombet Nathanael Fijalkow Karoliina Lehtinen [github]

Cost Automata, Safe Schemes, and Downward Closures David Barozzini Lorenzo Clemente Thomas Colcombet Paweł Parys [github]

Rewriting in the partial algebra of typed terms modulo AC Thomas Colcombet [github]

Playing Safe, Ten Years Later Thomas Colcombet Nathanael Fijalkow Florian Horn [github]

Cost Automata, Safe Schemes, and Downward Closures David Barozzini Lorenzo Clemente Thomas Colcombet Paweł Parys [github]

Z-polyregular functions Thomas Colcombet Gaetan Douéneau-Tabot Aliaume Lopez [github]

Automata and Minimization Thomas Colcombet Daniela Petrişan [github]

On the size of good-for-games Rabin automata and its link with the memory in Muller games Antonio Casares Thomas Colcombet Karoliina Lehtinen [github]

Unambiguity in Automata Theory (Dagstuhl Seminar 21452) Thomas Colcombet Karin Quaas Michał Skrzypczak [github]

Optimal transformations of Muller conditions Antonio Casares Thomas Colcombet Nathanael Fijalkow [github]

Regular Cost Functions, Part I: Logic and Algebra over Words Thomas Colcombet [github]

Unambiguous Separators for Tropical Tree Automata Thomas Colcombet Sylvain Lombardy [github]

Controlling a Random Population Thomas Colcombet Nathanael Fijalkow Pierre Ohlmann [github]

Cost Automata, Safe Schemes, and Downward Closures David Barozzini Lorenzo Clemente Thomas Colcombet Paweł Parys [github]

Limited Set quantifiers over Countable Linear Orderings Thomas Colcombet A. V. Sreejith [github]

An algebraic approach to MSO-definability on countable linear orderings Olivier Carton Thomas Colcombet Gabriele Puppis [github]

Automata Minimization: a Functorial Approach Thomas Colcombet Daniela Petrişan [github]

Controlling a random population Thomas Colcombet Nathanael Fijalkow Pierre Ohlmann [github]

Unambiguous separators for tropical tree automata Thomas Colcombet Sylvain Lombardy [github]

A Tight Lower Bound for Determinization of Transition Labeled Buchi Automata Thomas Colcombet Konrad Zdanowski [github]

On Reachability Problems for Low-Dimensional Matrix Semigroups Thomas Colcombet Joel Ouaknine Pavel Semukhin James Worrell [github]

Universal graphs and Good for small games automata: New tools for infinite duration games Thomas Colcombet Nathanael Fijalkow [github]

Parity games and universal graphs Thomas Colcombet Nathanael Fijalkow [github]

Automata and Program Analysis Thomas Colcombet Laure Daviaud Florian Zuleger [github]

Two-way Cost Automata and Cost Logics over Infinite Trees Achim Blumensath Thomas Colcombet Denis Kuperberg Paweł Parys Michael Vanden Boom [github]

Boundedness in languages of infinite words Mikołaj Bojańczyk Thomas Colcombet [github]

Unambiguity in Automata Theory Thomas Colcombet [github]

Tree-Walking Automata Do Not Recognize All Regular Languages MikoŁaj Bojańczyk Thomas Colcombet [github]

Tree-walking automata cannot be determinized Mikołaj Bojańczyk Thomas Colcombet [github]

Fragments of Fixpoint Logic on Data Words Thomas Colcombet Amaldev Manuel [github]

Size-Change Abstraction and Max-Plus Automata Laure Daviaud Thomas Colcombet Florian Zuleger [github]

On the positional determinacy of edge-labeled games Thomas Colcombet Damian Niwiński [github]

Factorisation Forests for Infinite Words Application to Countable Scattered Linear Orderings Thomas Colcombet [github]

Bounds in w-Regularity Mikolaj Bojanczyk Thomas Colcombet [github]

Deciding the weak definability of Buchi definable tree languages Thomas Colcombet Denis Kuperberg Christof Løding Michael Vanden Boom [github]

The Theory of Stabilisation Monoids and Regular Cost Functions Thomas Colcombet [github]

Approximate comparison of distance automata Thomas Colcombet Laure Daviaud [github]

Approximate comparison of distance automata Thomas Colcombet Laure Daviaud [github]

On Families of Graphs Having a Decidable First Order Theory with Reachability Thomas Colcombet [github]

Regular Languages of Words over Countable Linear Orderings Olivier Carton Thomas Colcombet Gabriele Puppis [github]

The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata Thomas Colcombet Christof Løding [github]

Regular Cost Functions, Part I: Logic and Algebra over Words Thomas Colcombet [github]

Forms of Determinism for Automata (Invited Talk) Thomas Colcombet [github]

The Nesting-Depth of Disjunctive mu-Calculus for Tree Languages and the Limitedness Problem Thomas Colcombet Christof Löding [github]

Green's Relations and Their Use in Automata Theory Thomas Colcombet [github]

Size-Change Abstraction and Max-Plus Automata Thomas Colcombet Laure Daviaud Florian Zuleger [github]

Perfect half space games Thomas Colcombet Marcin Jurdzinski Ranko Lazic Sylvain Schmitz [github]

Tree-walking automata do not recognize all regular languages Mikolaj Bojanczyk Thomas Colcombet [github]

Library Size: 13G (51 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]