| 2008 |
|---|
| 18 | EE | Thomas Colcombet,
Christof Löding:
The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem.
CSL 2008: 416-430 |
| 17 | EE | Thomas Colcombet,
Christof Löding:
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata.
ICALP (2) 2008: 398-409 |
| 16 | EE | Mikolaj Bojanczyk,
Thomas Colcombet:
Tree-Walking Automata Do Not Recognize All Regular Languages.
SIAM J. Comput. 38(2): 658-701 (2008) |
| 2007 |
|---|
| 15 | EE | Thomas Colcombet:
Factorisation Forests for Infinite Words.
FCT 2007: 226-237 |
| 14 | EE | Thomas Colcombet:
A Combinatorial Theorem for Trees.
ICALP 2007: 901-912 |
| 13 | EE | Thomas Colcombet:
On factorisation forests
CoRR abs/cs/0701113: (2007) |
| 12 | EE | Thomas Colcombet,
Christof Löding:
Transforming structures by set interpretations
CoRR abs/cs/0703039: (2007) |
| 11 | EE | Thomas Colcombet,
Christof Löding:
Transforming structures by set interpretations.
Logical Methods in Computer Science 3(2): (2007) |
| 2006 |
|---|
| 10 | EE | Mikolaj Bojanczyk,
Thomas Colcombet:
Bounds in w-Regularity.
LICS 2006: 285-296 |
| 9 | EE | Mikolaj Bojanczyk,
Thomas Colcombet:
Tree-walking automata cannot be determinized.
Theor. Comput. Sci. 350(2-3): 164-173 (2006) |
| 8 | EE | Thomas Colcombet,
Damian Niwinski:
On the positional determinacy of edge-labeled games.
Theor. Comput. Sci. 352(1-3): 190-196 (2006) |
| 2005 |
|---|
| 7 | EE | Mikolaj Bojanczyk,
Thomas Colcombet:
Tree-walking automata do not recognize all regular languages.
STOC 2005: 234-243 |
| 2004 |
|---|
| 6 | EE | Mikolaj Bojanczyk,
Thomas Colcombet:
Tree-Walking Automata Cannot Be Determinized.
ICALP 2004: 246-256 |
| 5 | EE | Thomas Colcombet,
Christof Löding:
On the Expressiveness of Deterministic Transducers over Infinite Trees.
STACS 2004: 428-439 |
| 2003 |
|---|
| 4 | EE | Arnaud Carayol,
Thomas Colcombet:
On Equivalent Representations of Infinite Structures.
ICALP 2003: 599-610 |
| 2002 |
|---|
| 3 | EE | Thomas Colcombet:
On Families of Graphs Having a Decidable First Order Theory with Reachability.
ICALP 2002: 98-109 |
| 2 | EE | Thomas Colcombet:
Rewriting in the partial algebra of typed terms modulo AC.
Electr. Notes Theor. Comput. Sci. 68(6): (2002) |
| 2000 |
|---|
| 1 | EE | Thomas Colcombet,
Pascal Fradet:
Enforcing Trace Properties by Program Transformation.
POPL 2000: 54-66 |
