Thomas Colcombet: Difference between revisions

Thomas Colcombet
Thomas Colcombet
Born	March 6, 1975 (age 49)
Alma mater	University of Rennes 1
Known for	tree walking automata
Awards	Bronze medal of the CNRS (2010)
	Scientific career
Fields	Theoretical Computer Science ; Automata theory
Institutions	Paris Diderot University
Doctoral advisor	Didier Caucal

Content deleted Content added

Inline

Revision as of 11:53, 25 March 2017

Thomas Colcombet (b. 1975) is a French theoretical computer scientist known for settling major open problems on tree walking automata^[1]^[2] jointly with Mikołaj Bojańczyk. Colcombet is currently a CNRS Research Director at Paris Diderot University.

Colcombet earned his undergraduate degree from École normale supérieure de Lyon (2000) and his doctorate from University of Rennes 1 (2004). Since 2004, he is a CNRS researcher, and a Research Director since 2016.

Besides his work on tree walking automata, Colcombet contributed to ω-automata,^[3] particularly to state complexity of Büchi automata,^[4] and to various topics in logic in computer science.

^ Bojańczyk, Mikołaj; Colcombet, Thomas (2006). "Tree-walking automata cannot be determinized". Theoretical Computer Science. 350 (2–3): 164–173. doi:10.1016/j.tcs.2005.10.031. ISSN 0304-3975.
^ Bojańczyk, MikoŁaj; Colcombet, Thomas (2008). "Tree-Walking Automata Do Not Recognize All Regular Languages". SIAM Journal on Computing. 38 (2): 658–701. doi:10.1137/050645427. ISSN 0097-5397.
^ Colcombet, Thomas; Fijalkow, Nathanaël (2016). "The Bridge Between Regular Cost Functions and Omega-Regular Languages". doi:10.4230/LIPIcs.ICALP.2016.126. ISBN 978-3-95977-013-2. {{cite journal}}: Cite journal requires |journal= (help); Unknown parameter |conference= ignored (help)
^ Colcombet, Thomas; Zdanowski, Konrad (2009). "A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata". 5556: 151–162. doi:10.1007/978-3-642-02930-1_13. ISSN 0302-9743. {{cite journal}}: Cite journal requires |journal= (help)