Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Colcombet, Thomas
202  Ergebnisse:
Personensuche X
?
1

From Muller to Parity and Rabin Automata: Optimal Transform..:

Casares, Antonio ; Colcombet, Thomas ; Fijalkow, Nathanaël.
TheoretiCS.  3 (2024)  - p. , 2024
Link: https://doi.org/10.46298..
 
?
2

ℤ-polyregular functions:

, In: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
Colcombet, Thomas ; Doueneau-Tabot, Gaetan ; Lopez, Aliaume - p. 1-13 , 2023
Link: https://doi.org/10.1109/..
 
?
3

The Theory of Universal Graphs for Infinite Duration Games:

Colcombet, Thomas ; Fijalkow, Nathanaël ; Gawrychowski, Paweł.
Logical Methods in Computer Science.  18, Issue 3 (2022)  - p. , 2022
Link: https://doi.org/10.46298..
 
?
4

First-order separation over countable ordinals:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,
Colcombet, Thomas ; van Gool, Sam ; Morvan, Rémi - p. 264-284 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Controlling a random population:

Colcombet, Thomas ; Fijalkow, Nathanaël ; Ohlmann, Pierre
Logical Methods in Computer Science.  17, Issue 4 (2021)  - p. , 2021
Link: https://doi.org/10.46298..
 
?
6

Controlling a Random Population:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,
Colcombet, Thomas ; Fijalkow, Nathanaël ; Ohlmann, Pierre - p. 119-135 , 2020
Link: https://doi.org/10.1007/..
 
?
7

Universal Graphs and Good for Games Automata: New Tools for..:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,
Colcombet, Thomas ; Fijalkow, Nathanaël - p. 1-26 , 2019
Link: https://doi.org/10.1007/..
 
?
8

AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINE..:

CARTON, OLIVIER ; COLCOMBET, THOMAS ; PUPPIS, GABRIELE
The Journal of Symbolic Logic.  83 (2018)  3 - p. 1147-1189 , 2018
Link: https://www.jstor.org/st..
 
?
9

AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINE..:

CARTON, OLIVIER ; COLCOMBET, THOMAS ; PUPPIS, GABRIELE
The Journal of Symbolic Logic.  83 (2018)  3 - p. 1147-1189 , 2018
Link: https://doi.org/10.1017/..
 
?
10

Logic and regular cost functions:

, In: Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science,
Colcombet, Thomas - p. 1-4 , 2017
Link: https://dl.acm.org/doi/1..
 
?
11

Perfect half space games:

, In: Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science,
Colcombet, Thomas ; Jurdziński, Marcin ; Lazić, Ranko. - p. 1-11 , 2017
Link: https://dl.acm.org/doi/1..
 
?
12

Automata and minimization:

Colcombet, Thomas ; Petrişan, Daniela
ACM SIGLOG News.  4 (2017)  2 - p. 4-27 , 2017
Link: https://doi.org/10.1145/..
 
?
13

Automata and minimization:

Colcombet, Thomas ; Petrişan, Daniela
ACM SIGLOG News.  4 (2017)  2 - p. 4-27 , 2017
Link: https://dl.acm.org/doi/1..
 
?
14

Boundedness problems in resource games, logics and automati..:

Lang, Martin , 2016
Link: http://nbn-resolving.de/..
 
?
15

Games with bound guess actions:

, In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science,
Colcombet, Thomas ; Göller, Stefan - p. 257-266 , 2016
Link: https://dl.acm.org/doi/1..
 
1-15