受强制性开放获取政策约束的文章 - Michaël Cadilhac了解详情
可在其他位置公开访问的文章：8 篇
On polynomial recursive sequences
M Cadilhac, F Mazowiecki, C Paperman, M Pilipczuk, G Sénizergues
Theory of Computing Systems 68 (4), 593-614, 2024
强制性开放获取政策： European Commission
Continuity and rational functions
M Cadilhac, O Carton, C Paperman
The 44th International Colloquium on Automata, Languages, and Programming …, 2017
强制性开放获取政策： German Research Foundation
Acacia-bonsai: a modern implementation of downset-based LTL realizability
M Cadilhac, GA Pérez
International Conference on Tools and Algorithms for the Construction and …, 2023
强制性开放获取政策： Research Foundation (Flanders)
Parikh One-Counter Automata
M Cadilhac, A Ghosh, GA Pérez, R Raha
LIPIcs: Leibniz International Proceedings in Informatics.-Place of …, 2023
强制性开放获取政策： Research Foundation (Flanders), Narodowe Centrum Nauki
The Regular Languages of First-Order Logic with One Alternation
C Barloy, M Cadilhac, C Paperman, T Zeume
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022
强制性开放获取政策： German Research Foundation
Continuity of functional transducers: a profinite study of rational functions
M Cadilhac, O Carton, C Paperman
Logical Methods in Computer Science 16, 2020
强制性开放获取政策： German Research Foundation, Agence Nationale de la Recherche
Weak cost register automata are still powerful
S Almagor, M Cadilhac, F Mazowiecki, GA Pérez
International Journal of Foundations of Computer Science 31 (06), 689-709, 2020
强制性开放获取政策： European Commission, Agence Nationale de la Recherche
A crevice on the Crane Beach: Finite-degree predicates
M Cadilhac, C Paperman
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-9, 2017
强制性开放获取政策： German Research Foundation
出版信息和资助信息由计算机程序自动确定