( en | de | ru )

 

Disambiguation of "Colcombet, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
Size-Change Abstraction and Max-Plus Automata.

, , and . MFCS (1), volume 8634 of Lecture Notes in Computer Science, page 208-219. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Thomas

Thomas Harasim

Die Rolle des nucleostemin-Gens in dem Prozess der Ribosomenbiogenese. Uni München, (2009)

Thomas Baron

Untersuchungen an ungeschädigten und durch Pilzbefall geschädigten Nadelholzbauteilen mit ausgewählten Prüfverfahren. TU Dresden, (2009)

Thomas Böttcher

Naturstoffe und ihre Derivate als molekulare Sonden: Identifikation ihrer Angriffsziele und Inhibition der Virulenz in pathogenen Bakterien. Uni München, (2009)

Thomas Potinecke

Methode zur Systematisierung von Teilprozessen in der Produktentwicklung beim Einsatz von CAx-Technologien. Uni Stuttgart, (2009)
 

Other publications of authors with the same name

Approximate Comparison of Functions Computed by Distance Automata., and . Theory Comput. Syst., 58 (4): 579-613 (2016)Automata in the Category of Glued Vector Spaces., and . MFCS, volume 83 of LIPIcs, page 52:1-52:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Combinatorial Expressions and Lower Bounds., and . STACS, volume 30 of LIPIcs, page 249-261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)On factorisation forests. CoRR, (2007)On the positional determinacy of edge-labeled games., and . Theor. Comput. Sci., 352 (1-3): 190-196 (2006)Transforming structures by set interpretations., and . Log. Methods Comput. Sci., (2007)Controlling a random population., , and . Log. Methods Comput. Sci., (2021)An Algebraic Approach to MSO-Definability on Countable linear Orderings., , and . J. Symb. Log., 83 (3): 1147-1189 (2018)A Complexity Approach to Tree Algebras: the Polynomial Case., and . MFCS, volume 241 of LIPIcs, page 37:1-37:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Cost Functions Definable by Min/Max Automata., , , and . STACS, volume 47 of LIPIcs, page 29:1-29:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)