Affine Parikh automata∗ M Cadilhac, A Finkel, P McKenzie
RAIRO-Theoretical Informatics and Applications 46 (4), 511-545, 2012
42 * 2012 Unambiguous constrained automata M Cadilhac, A Finkel, P McKenzie
International Journal of Foundations of Computer Science 24 (07), 1099-1116, 2013
21 2013 Bounded parikh automata M Cadilhac, A Finkel, P McKenzie
International Journal of Foundations of Computer Science 23 (08), 1691-1709, 2012
18 2012 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
17 2007 Continuity and rational functions M Cadilhac, O Carton, C Paperman
The 44th International Colloquium on Automata, Languages, and Programming …, 2017
11 2017 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
11 2015 On polynomial recursive sequences M Cadilhac, F Mazowiecki, C Paperman, M Pilipczuk, G Sénizergues
Theory of Computing Systems, 1-22, 2021
9 2021 Rational subsets of Baumslag-Solitar groups M Cadilhac, D Chistikov, G Zetzsche
arXiv preprint arXiv:2006.11898, 2020
8 2020 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
6 2018 Value automata with filters M Cadilhac, A Krebs, N Limaye
arXiv preprint arXiv:1510.02393, 2015
5 2015 Continuity of functional transducers: a profinite study of rational functions C Paperman, O Carton, M Cadilhac
Logical Methods in Computer Science 16, 2020
2 2020 Message relaying techniques for computational grids and their relations to fault tolerant message passing for the Grid M Cadilhac, T Herault, P Lemarinier
2nd CoreGRID Workshop on GRID and Peer to Peer Systems Architecture, 2006
2 2006 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
1 2020 The impatient may use limited optimism to minimize regret M Cadilhac, GA Pérez, M Bogaard
International Conference on Foundations of Software Science and Computation …, 2019
1 2019 The algebraic theory of Parikh automata M Cadilhac, A Krebs, P McKenzie
Theory of Computing Systems 62 (5), 1241-1268, 2018
1 2018 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
1 2017 The algebraic theory of Parikh automata M Cadilhac, A Krebs, P McKenzie
International Conference on Algebraic Informatics, 60-73, 2013
1 2013 Automates À Contraintes Semilinéaires M Cadilhac
Université de Montréal, 2012
1 2012 The regular languages of wire linear AC M Cadilhac, C Paperman
Acta Informatica, 1-16, 2022
2022 The Reactive Synthesis Competition (SYNTCOMP): 2018-2021 S Jacobs, GA Perez, R Abraham, V Bruyere, M Cadilhac, M Colange, ...
arXiv preprint arXiv:2206.00251, 2022
2022 
Michael BlondinAssistant professor, Université de SherbrookeAdresse e-mail validée de usherbrooke.ca
