Thomas Colcombet Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet, Laure Daviaud: Approximate comparison of distance automata. STACS 2013: 574-585
2012
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet: Forms of Determinism for Automata (Invited Talk). STACS 2012: 1-23
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet: Regular Cost Functions, Part I: Logic and Algebra over Words. CoRR abs/1212.6937 (2012)
2011
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Olivier Carton, Thomas Colcombet, Gabriele Puppis: Regular Languages of Words over Countable Linear Orderings. ICALP (2) 2011: 125-136
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet: Green's Relations and Their Use in Automata Theory. LATA 2011: 1-21
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet, Clemens Ley, Gabriele Puppis: On the Use of Guards for Logics with Data. MFCS 2011: 243-255
2010
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet: Factorization forests for infinite words and applications to countable scattered linear orderings. Theor. Comput. Sci. 411(4-5): 751-764 (2010)
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy: Regular Temporal Cost Functions. ICALP (2) 2010: 563-574
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet, Christof Löding: Regular Cost Functions over Finite Trees. LICS 2010: 70-79
2009
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet: The Theory of Stabilisation Monoids and Regular Cost Functions. ICALP (2) 2009: 139-150
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet, Konrad Zdanowski: A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata. ICALP (2) 2009: 151-162
2008
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mikolaj Bojanczyk, Thomas Colcombet: Tree-Walking Automata Do Not Recognize All Regular Languages. SIAM J. Comput. 38(2): 658-701 (2008)
c12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Achim Blumensath, Thomas Colcombet, Christof Löding: Logical theories and compatible operations. Logic and Automata 2008: 73-106
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet, Christof Löding: The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. CSL 2008: 416-430
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet, Christof Löding: The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. ICALP (2) 2008: 398-409
2007
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet, Christof Löding: Transforming structures by set interpretations. Logical Methods in Computer Science 3(2) (2007)
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet: Factorisation Forests for Infinite Words. FCT 2007: 226-237
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet: A Combinatorial Theorem for Trees. ICALP 2007: 901-912
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet: On factorisation forests. CoRR abs/cs/0701113 (2007)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet, Christof Löding: Transforming structures by set interpretations. CoRR abs/cs/0703039 (2007)
2006
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mikolaj Bojanczyk, Thomas Colcombet: Tree-walking automata cannot be determinized. Theor. Comput. Sci. 350(2-3): 164-173 (2006)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet, Damian Niwinski: On the positional determinacy of edge-labeled games. Theor. Comput. Sci. 352(1-3): 190-196 (2006)
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mikolaj Bojanczyk, Thomas Colcombet: Bounds in w-Regularity. LICS 2006: 285-296
2005
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mikolaj Bojanczyk, Thomas Colcombet: Tree-walking automata do not recognize all regular languages. STOC 2005: 234-243
2004
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Mikolaj Bojanczyk, Thomas Colcombet: Tree-Walking Automata Cannot Be Determinized. ICALP 2004: 246-256
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet, Christof Löding: On the Expressiveness of Deterministic Transducers over Infinite Trees. STACS 2004: 428-439
2003
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Arnaud Carayol, Thomas Colcombet: On Equivalent Representations of Infinite Structures. ICALP 2003: 599-610
2002
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet: Rewriting in the partial algebra of typed terms modulo AC. Electr. Notes Theor. Comput. Sci. 68(6): 40-54 (2002)
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet: On Families of Graphs Having a Decidable First Order Theory with Reachability. ICALP 2002: 98-109
2000
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thomas Colcombet, Pascal Fradet: Enforcing Trace Properties by Program Transformation. POPL 2000: 54-66

Coauthor Index

1Achim Blumensath
[c12]
2Mikolaj Bojanczyk
[j5] [j3] [c7] [c6] [c5]
3Arnaud Carayol
[c3]
4Olivier Carton
[c19]
5Laure Daviaud
[c21]
6Pascal Fradet
[c1]
7Denis Kuperberg
[c16]
8Clemens Ley
[c17]
9Sylvain Lombardy
[c16]
10Christof Löding
[c15] [c12] [c11] [c10] [j4] [i1] [c4]
11Damian Niwinski
[j2]
12Gabriele Puppis
[c19] [c17]
13Konrad Zdanowski
[c13]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Wed May 22 00:46:08 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page