| Affine Parikh automata∗ M Cadilhac, A Finkel, P McKenzie RAIRO-Theoretical Informatics and Applications 46 (4), 511-545, 2012 | 58* | 2012 |
| The reactive synthesis competition (SYNTCOMP): 2018–2021 S Jacobs, GA Pérez, R Abraham, V Bruyere, M Cadilhac, M Colange, ... International journal on software tools for technology transfer 26 (5), 551-567, 2024 | 39 | 2024 |
| Bounded parikh automata M Cadilhac, A Finkel, P McKenzie International Journal of Foundations of Computer Science 23 (08), 1691-1709, 2012 | 34 | 2012 |
| Unambiguous constrained automata M Cadilhac, A Finkel, P McKenzie International Journal of Foundations of Computer Science 24 (07), 1099-1116, 2013 | 27 | 2013 |
| Rational subsets of Baumslag-Solitar groups M Cadilhac, D Chistikov, G Zetzsche arXiv preprint arXiv:2006.11898, 2020 | 25 | 2020 |
| On polynomial recursive sequences M Cadilhac, F Mazowiecki, C Paperman, M Pilipczuk, G Sénizergues Theory of Computing Systems 68 (4), 593-614, 2024 | 19 | 2024 |
| Evaluating complex MAC protocols for sensor networks with APMC M Cadilhac, T Hérault, R Lassaigne, S Peyronnet, S Tixeuil Electronic Notes in Theoretical Computer Science 185, 33-46, 2007 | 18 | 2007 |
| 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 | 13 | 2023 |
| Continuity and rational functions M Cadilhac, O Carton, C Paperman The 44th International Colloquium on Automata, Languages, and Programming …, 2017 | 11 | 2017 |
| The reactive synthesis competition (SYNTCOMP): 2018-2021. CoRR abs/2206.00251 (2022) S Jacobs, GA Pérez, R Abraham, V Bruyère, M Cadilhac, M Colange, ... | 11 | |
| Weak cost register automata are still powerful S Almagor, M Cadilhac, F Mazowiecki, GA Pérez International Conference on Developments in Language Theory, 83-95, 2018 | 9 | 2018 |
| A circuit complexity approach to transductions M Cadilhac, A Krebs, M Ludwig, C Paperman International Symposium on Mathematical Foundations of Computer Science, 141-153, 2015 | 9 | 2015 |
| The algebraic theory of Parikh automata M Cadilhac, A Krebs, P McKenzie Theory of Computing Systems 62 (5), 1241-1268, 2018 | 7 | 2018 |
| 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 | 5 | 2020 |
| Continuity of functional transducers: A profinite study of rational functions M Cadilhac, O Carton, C Paperman Logical Methods in Computer Science 16, 2020 | 5 | 2020 |
| Value automata with filters M Cadilhac, A Krebs, N Limaye arXiv preprint arXiv:1510.02393, 2015 | 5 | 2015 |
| Parikh one-counter automata M Cadilhac, A Ghosh, GA Pérez, R Raha Information and Computation, 105322, 2025 | 4 | 2025 |
| The impatient may use limited optimism to minimize regret M Cadilhac, GA Pérez, M Van Den Bogaard International Conference on Foundations of Software Science and Computation …, 2019 | 4 | 2019 |
| Knee-Deep in C-RASP: A Transformer Depth Hierarchy A Yang, M Cadilhac, D Chiang arXiv preprint arXiv:2506.16055, 2025 | 3 | 2025 |
| 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 | 3 | 2022 |
Michael BlondinAssociate professor, Université de SherbrookeVerified email at usherbrooke.ca
