BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Finland
1 × France
1 × Greece
1 × Iceland
1 × Poland
1 × Switzerland
1 × The Netherlands
1 × United Kingdom
2 × Italy
2 × Japan
2 × Spain
4 × USA
Collaborated with:
C.Löding M.Bojanczyk D.Kuperberg M.V.Boom A.V.Sreejith K.Zdanowski A.Carayol P.Fradet O.Carton G.Puppis S.Lombardy M.Benedikt B.t.Cate A.Blumensath P.Parys
Talks about:
tree (7) automata (6) regular (6) cost (5) languag (4) theori (4) function (3) order (3) logic (3) determin (2)

Person: Thomas Colcombet

DBLP DBLP: Colcombet:Thomas

Contributed to:

ICALP (2) 20152015
LICS 20152015
CSL-LICS 20142014
CSL 20132013
LICS 20132013
ICALP (2) 20112011
LATA 20112011
ICALP (2) 20102010
LICS 20102010
ICALP (2) 20092009
CSL 20082008
ICALP (2) 20082008
ICALP 20072007
LICS 20062006
STOC 20052005
ICALP 20042004
ICALP 20032003
ICALP 20022002
POPL 20002000

Wrote 20 papers:

ICALP-v2-2015-ColcombetS #linear #order #quantifier #set
Limited Set quantifiers over Countable Linear Orderings (TC, AVS), pp. 146–158.
LICS-2015-BenediktCCB #bound #complexity #logic
The Complexity of Boundedness for Guarded Logics (MB, BtC, TC, MVB), pp. 293–304.
LICS-CSL-2014-BlumensathCKPB #automaton #infinity #logic
Two-way cost automata and cost logics over infinite trees (AB, TC, DK, PP, MVB), p. 9.
CSL-2013-ColcombetKLB #automaton
Deciding the weak definability of Büchi definable tree languages (TC, DK, CL, MVB), pp. 215–230.
LICS-2013-Colcombet #logic #monad #set #using #word
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory (TC), p. 123.
ICALP-v2-2011-CartonCP #linear #order #regular expression #word
Regular Languages of Words over Countable Linear Orderings (OC, TC, GP), pp. 125–136.
LATA-2011-Colcombet #automaton
Green’s Relations and Their Use in Automata Theory (TC), pp. 1–21.
ICALP-v2-2010-ColcombetKL #cost analysis
Regular Temporal Cost Functions (TC, DK, SL), pp. 563–574.
LICS-2010-ColcombetL #cost analysis #finite
Regular Cost Functions over Finite Trees (TC, CL), pp. 70–79.
ICALP-v2-2009-Colcombet #cost analysis #formal method #monad
The Theory of Stabilisation Monoids and Regular Cost Functions (TC), pp. 139–150.
ICALP-v2-2009-ColcombetZ #automaton #bound
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata (TC, KZ), pp. 151–162.
CSL-2008-ColcombetL #calculus #problem #μ-calculus
The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (TC, CL), pp. 416–430.
ICALP-B-2008-ColcombetL #automaton #nondeterminism
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (TC, CL), pp. 398–409.
ICALP-2007-Colcombet #combinator #theorem
A Combinatorial Theorem for Trees (TC), pp. 901–912.
LICS-2006-BojanczykC #bound
Bounds in w-Regularity (MB, TC), pp. 285–296.
STOC-2005-BojanczykC #automaton #regular expression
Tree-walking automata do not recognize all regular languages (MB, TC), pp. 234–243.
ICALP-2004-BojanczykC #automaton
Tree-Walking Automata Cannot Be Determinized (MB, TC), pp. 246–256.
ICALP-2003-CarayolC #infinity #on the
On Equivalent Representations of Infinite Structures (AC, TC), pp. 599–610.
ICALP-2002-Colcombet #decidability #first-order #graph #on the #product line #reachability
On Families of Graphs Having a Decidable First Order Theory with Reachability (TC), pp. 98–109.
POPL-2000-ColcombetF #program transformation
Enforcing Trace Properties by Program Transformation (TC, PF), pp. 54–66.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.