The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Colcombet: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mikolaj Bojanczyk, Thomas Colcombet
    Tree-Walking Automata Cannot Be Determinized. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:246-256 [Conf]
  2. Arnaud Carayol, Thomas Colcombet
    On Equivalent Representations of Infinite Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:599-610 [Conf]
  3. Thomas Colcombet
    On Families of Graphs Having a Decidable First Order Theory with Reachability. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:98-109 [Conf]
  4. Mikolaj Bojanczyk, Thomas Colcombet
    Bounds in w-Regularity. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:285-296 [Conf]
  5. Thomas Colcombet, Pascal Fradet
    Enforcing Trace Properties by Program Transformation. [Citation Graph (0, 0)][DBLP]
    POPL, 2000, pp:54-66 [Conf]
  6. Thomas Colcombet, Christof Löding
    On the Expressiveness of Deterministic Transducers over Infinite Trees. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:428-439 [Conf]
  7. Mikolaj Bojanczyk, Thomas Colcombet
    Tree-walking automata do not recognize all regular languages. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:234-243 [Conf]
  8. Thomas Colcombet
    Rewriting in the partial algebra of typed terms modulo AC. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:68, n:6, pp:- [Journal]
  9. Mikolaj Bojanczyk, Thomas Colcombet
    Tree-walking automata cannot be determinized. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:2-3, pp:164-173 [Journal]
  10. Thomas Colcombet, Damian Niwinski
    On the positional determinacy of edge-labeled games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:352, n:1-3, pp:190-196 [Journal]
  11. Thomas Colcombet
    Factorisation Forests for Infinite Words. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:226-237 [Conf]
  12. Thomas Colcombet
    A Combinatorial Theorem for Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:901-912 [Conf]
  13. Thomas Colcombet
    On factorisation forests [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  14. Thomas Colcombet, Christof Löding
    Transforming structures by set interpretations [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  15. The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. [Citation Graph (, )][DBLP]


  16. The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. [Citation Graph (, )][DBLP]


  17. The Theory of Stabilisation Monoids and Regular Cost Functions. [Citation Graph (, )][DBLP]


  18. A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata. [Citation Graph (, )][DBLP]


  19. Regular Temporal Cost Functions. [Citation Graph (, )][DBLP]


  20. Regular Cost Functions over Finite Trees. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002