Michaël Cadilhac

Publication Activity (10 Years)

Years Active: 2007-2023
Publications (10 Years): 27

Top Topics

Finite Automata

Top Venues

Publications

Michaël Cadilhac, Guillermo A. Pérez
Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability. TACAS (2) (2023)
Michaël Cadilhac, Arka Ghosh, Guillermo A. Pérez, Ritam Raha
Parikh One-Counter Automata. MFCS (2023)
Corentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume
The Regular Languages of First-Order Logic with One Alternation. LICS (2022)
Michaël Cadilhac, Charles Paperman
. Acta Informatica 59 (4) (2022)
Swen Jacobs, Guillermo A. Pérez, Remco Abraham, Véronique Bruyère, Michaël Cadilhac, Maximilien Colange, Charly Delfosse, Tom van Dijk, Alexandre Duret-Lutz, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Klara J. Meyer, Thibaud Michaud, Adrien Pommellet, Florian Renkin, Philipp Schlehuber-Caissier, Mouhammad Sakr, Salomon Sickert, Gaëtan Staquet, Clément Tamines, Leander Tentrup, Adam Walker
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. CoRR (2022)
Michaël Cadilhac, Guillermo A. Pérez
Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability. CoRR (2022)
Corentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume
The Regular Languages of First-Order Logic with One Alternation. CoRR (2022)
Michaël Cadilhac
Review of Communication Complexity and Applications by Anup Rao and Amir Yehudayoff. SIGACT News 52 (3) (2021)
Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez
Weak Cost Register Automata are Still Powerful. Int. J. Found. Comput. Sci. 31 (6) (2020)
Michaël Cadilhac, Olivier Carton, Charles Paperman
Continuity of Functional Transducers: A Profinite Study of Rational Functions. Log. Methods Comput. Sci. 16 (1) (2020)
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues
On Polynomial Recursive Sequences. ICALP (2020)
Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche
Rational subsets of Baumslag-Solitar groups. CoRR (2020)
Michaël Cadilhac, Filip Mazowiecki, Charles Paperman, Michal Pilipczuk, Géraud Sénizergues
On polynomial recursive sequences. CoRR (2020)
Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche
Rational Subsets of Baumslag-Solitar Groups. ICALP (2020)
Michaël Cadilhac, Guillermo A. Pérez, Marie van den Bogaard
The Impatient May Use Limited Optimism to Minimize Regret. FoSSaCS (2019)
Michaël Cadilhac, Guillermo A. Pérez, Marie van den Bogaard
The Impatient May Use Limited Optimism to Minimize Regret. CoRR (2018)
Michaël Cadilhac, Olivier Carton, Charles Paperman
Continuity and Rational Functions. CoRR (2018)
Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez
Weak Cost Register Automata are Still Powerful. CoRR (2018)
Michaël Cadilhac, Andreas Krebs, Pierre McKenzie
The Algebraic Theory of Parikh Automata. Theory Comput. Syst. 62 (5) (2018)
Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez
Weak Cost Register Automata Are Still Powerful. DLT (2018)
Michaël Cadilhac, Charles Paperman
A Crevice on the Crane Beach: Finite-Degree Predicates. CoRR (2017)
Michaël Cadilhac, Charles Paperman
A crevice on the Crane Beach: Finite-degree predicates. LICS (2017)
Michaël Cadilhac, Olivier Carton, Charles Paperman
Continuity and Rational Functions. ICALP (2017)
Michaël Cadilhac, Andreas Krebs, Klaus-Jörn Lange
A Language-Theoretical Approach to Descriptive Complexity. DLT (2016)
Michaël Cadilhac
Review of: The Golden Ratio and Fibonacci Numbers by Richard A. Dunlap. SIGACT News 47 (4) (2016)
Michaël Cadilhac, Andreas Krebs, Nutan Limaye
Value Automata with Filters. CoRR (2015)
Michaël Cadilhac, Andreas Krebs, Michael Ludwig, Charles Paperman
A Circuit Complexity Approach to Transductions. MFCS (1) (2015)
Michaël Cadilhac
Review of graph structure and monadic second-order logic: a language-theoretic approach by Bruno Courcelle and Joost Engelfriet. SIGACT News 45 (3) (2014)
Michaël Cadilhac, Andreas Krebs, Pierre McKenzie
Extremely uniform branching programs. NCMA (2014)
Michaël Cadilhac, Andreas Krebs, Pierre McKenzie
The Algebraic Theory of Parikh Automata. CAI (2013)
Michaël Cadilhac, Andreas Krebs, Pierre McKenzie
The Algebraic Theory of Parikh Automata. Electron. Colloquium Comput. Complex. 20 (2013)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
Unambiguous constrained Automata. Int. J. Found. Comput. Sci. 24 (7) (2013)
Michaël Cadilhac
Review of proofs and algorithms by Gilles Dowek (translation by Maribel Fernandez). SIGACT News 44 (4) (2013)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
Bounded Parikh Automata. Int. J. Found. Comput. Sci. 23 (8) (2012)
Michaël Cadilhac
Review of handbook of weighted automata, edited by Manfred Droste, Werner Kuich and Heiko Vogler. SIGACT News 43 (3) (2012)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
Unambiguous Constrained Automata. Developments in Language Theory (2012)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
Affine Parikh automata. RAIRO Theor. Informatics Appl. 46 (4) (2012)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
Bounded Parikh Automata WORDS (2011)
Michaël Cadilhac
Review of combinatorics: a guided tour by David R. Mazur. SIGACT News 42 (3) (2011)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
On the Expressiveness of Parikh Automata and Related Models. NCMA (2011)
Michaël Cadilhac, Alain Finkel, Pierre McKenzie
Storming the Parikh Automaton CoRR (2011)
Michaël Cadilhac, Thomas Hérault, Richard Lassaigne, Sylvain Peyronnet, Sébastien Tixeuil
Evaluating Complex MAC Protocols for Sensor Networks with APMC. Electron. Notes Theor. Comput. Sci. 185 (2007)