 | 2012 |
|---|
| 28 |       | Thomas Colcombet:
Forms of Determinism for Automata (Invited Talk).
STACS 2012: 1-23 |
| 2011 |
|---|
| 27 | | Olivier Carton,
Thomas Colcombet,
Gabriele Puppis:
Regular Languages of Words over Countable Linear Orderings.
ICALP (2) 2011: 125-136 |
| 26 | | Thomas Colcombet:
Green's Relations and Their Use in Automata Theory.
LATA 2011: 1-21 |
| 25 | | Thomas Colcombet,
Clemens Ley,
Gabriele Puppis:
On the Use of Guards for Logics with Data.
MFCS 2011: 243-255 |
| 2010 |
|---|
| 24 | | Thomas Colcombet,
Denis Kuperberg,
Sylvain Lombardy:
Regular Temporal Cost Functions.
ICALP (2) 2010: 563-574 |
| 23 | | Thomas Colcombet,
Christof Löding:
Regular Cost Functions over Finite Trees.
LICS 2010: 70-79 |
| 22 | | Thomas Colcombet:
Factorization forests for infinite words and applications to countable scattered linear orderings.
Theor. Comput. Sci. 411(4-5): 751-764 (2010) |
| 2009 |
|---|
| 21 | | Thomas Colcombet:
The Theory of Stabilisation Monoids and Regular Cost Functions.
ICALP (2) 2009: 139-150 |
| 20 | | Thomas Colcombet,
Konrad Zdanowski:
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata.
ICALP (2) 2009: 151-162 |
| 2008 |
|---|
| 19 | | Thomas Colcombet,
Christof Löding:
The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem.
CSL 2008: 416-430 |
| 18 | | Thomas Colcombet,
Christof Löding:
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata.
ICALP (2) 2008: 398-409 |
| 17 |  | Achim Blumensath,
Thomas Colcombet,
Christof Löding:
Logical theories and compatible operations.
Logic and Automata 2008: 73-106 |
| 16 | | Mikolaj Bojanczyk,
Thomas Colcombet:
Tree-Walking Automata Do Not Recognize All Regular Languages.
SIAM J. Comput. 38(2): 658-701 (2008) |
| 2007 |
|---|
| 15 | | Thomas Colcombet:
Factorisation Forests for Infinite Words.
FCT 2007: 226-237 |
| 14 | | Thomas Colcombet:
A Combinatorial Theorem for Trees.
ICALP 2007: 901-912 |
| 13 | | Thomas Colcombet:
On factorisation forests
CoRR abs/cs/0701113: (2007) |
| 12 | | Thomas Colcombet,
Christof Löding:
Transforming structures by set interpretations
CoRR abs/cs/0703039: (2007) |
| 11 | | Thomas Colcombet,
Christof Löding:
Transforming structures by set interpretations.
Logical Methods in Computer Science 3(2): (2007) |
| 2006 |
|---|
| 10 | | Mikolaj Bojanczyk,
Thomas Colcombet:
Bounds in w-Regularity.
LICS 2006: 285-296 |
| 9 | | Mikolaj Bojanczyk,
Thomas Colcombet:
Tree-walking automata cannot be determinized.
Theor. Comput. Sci. 350(2-3): 164-173 (2006) |
| 8 | | Thomas Colcombet,
Damian Niwinski:
On the positional determinacy of edge-labeled games.
Theor. Comput. Sci. 352(1-3): 190-196 (2006) |
| 2005 |
|---|
| 7 | | Mikolaj Bojanczyk,
Thomas Colcombet:
Tree-walking automata do not recognize all regular languages.
STOC 2005: 234-243 |
| 2004 |
|---|
| 6 | | Mikolaj Bojanczyk,
Thomas Colcombet:
Tree-Walking Automata Cannot Be Determinized.
ICALP 2004: 246-256 |
| 5 | | Thomas Colcombet,
Christof Löding:
On the Expressiveness of Deterministic Transducers over Infinite Trees.
STACS 2004: 428-439 |
| 2003 |
|---|
| 4 | | Arnaud Carayol,
Thomas Colcombet:
On Equivalent Representations of Infinite Structures.
ICALP 2003: 599-610 |
| 2002 |
|---|
| 3 | | Thomas Colcombet:
On Families of Graphs Having a Decidable First Order Theory with Reachability.
ICALP 2002: 98-109 |
| 2 | | Thomas Colcombet:
Rewriting in the partial algebra of typed terms modulo AC.
Electr. Notes Theor. Comput. Sci. 68(6): 40-54 (2002) |
| 2000 |
|---|
| 1 | | Thomas Colcombet,
Pascal Fradet:
Enforcing Trace Properties by Program Transformation.
POPL 2000: 54-66 |
Data released under the ODC-BY 1.0 license — See also our legal information page