The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata. - Arnaud Carayol; Stefan Wöhrle (FSTTCS, 2003)

On Equivalent Representations of Infinite Structures. - Arnaud Carayol; Thomas Colcombet (ICALP, 2003)

On the Representation of McCarthy's amb in the π-calculus. - Arnaud Carayol; Daniel Hirschkoff; Davide Sangiorgi (EXPRESS, 2003)

Regular Sets of Higher-Order Pushdown Stacks. - Arnaud Carayol (MFCS, 2005)

On the representation of McCarthy's amb in the Pi-calculus. - Arnaud Carayol; Daniel Hirschkoff; Davide Sangiorgi (Theor. Comput. Sci., 2005)

On Rational Trees. - Arnaud Carayol; Christophe Morvan (CSL, 2006)

The Kleene Equality for Graphs. - Arnaud Carayol; Didier Caucal (MFCS, 2006)

Linearly bounded infinite graphs. - Arnaud Carayol; Antoine Meyer (Acta Informatica, 2006)

Context-Sensitive Languages, Rational Graphs and Determinism. - Arnaud Carayol; Antoine Meyer (Log. Methods Comput. Sci., 2006)

Automates infinis, logiques et langages. - Arnaud Carayol (2006)

MSO on the Infinite Binary Tree: Choice and Order. - Arnaud Carayol; Christof Löding (CSL, 2007)

Winning Regions of Higher-Order Pushdown Games. - Arnaud Carayol; Matthew Hague; Antoine Meyer; C.-H. Luke Ong; Olivier Serre (LICS, 2008)

Positional Strategies for Higher-Order Pushdown Parity Games. - Arnaud Carayol; Michaela Slaats (MFCS, 2008)

Structures Defined by Higher-Order Recursion Schemes. - Arnaud Carayol (FICS, 2010)

Linear Orders in the Pushdown Hierarchy. - Laurent Braud; Arnaud Carayol (ICALP (2), 2010)

Recursion Schemes and Logical Reflection. - Christopher H. Broadbent; Arnaud Carayol; C.-H. Luke Ong; Olivier Serre (LICS, 2010)

Qualitative Tree Languages. - Arnaud Carayol; Axel Haddad; Olivier Serre (LICS, 2011)

Algebraic Synchronization Trees and Processes. - Luca Aceto; Arnaud Carayol; Zoltán Ésik; Anna Ingólfsdóttir (ICALP (2), 2012)

A Saturation Method for Collapsible Pushdown Systems. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Olivier Serre (ICALP (2), 2012)

A Context-Free Linear Ordering with an Undecidable First-Order Theory. - Arnaud Carayol; Zoltán Ésik (IFIP TCS, 2012)

Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection. - Arnaud Carayol; Olivier Serre (LICS, 2012)

Distribution of the number of accessible states in a random deterministic automaton. - Arnaud Carayol; Cyril Nicaud (STACS, 2012)

C-SHORe: a collapsible approach to higher-order verification. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Olivier Serre (ICFP, 2013)

The FC-rank of a context-free language. - Arnaud Carayol; Zoltán Ésik (Inf. Process. Lett., 2013)

Regular Strategies in Pushdown Reachability Games. - Arnaud Carayol; Matthew Hague (RP, 2014)

Saturation algorithms for model-checking pushdown systems. - Arnaud Carayol; Matthew Hague (AFL, 2014)

Randomization in Automata on Infinite Trees. - Arnaud Carayol; Axel Haddad; Olivier Serre (ACM Trans. Comput. Log., 2014)

Counting Branches in Trees Using Games. - Arnaud Carayol; Axel Haddad; Olivier Serre (CoRR, 2015)

Erratum for "Randomization in Automata on Infinite Trees". - Arnaud Carayol; Axel Haddad; Olivier Serre (ACM Trans. Comput. Log., 2015)

Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. - Arnaud Carayol; Christof Löding; Olivier Serre (LICS, 2016)

Marking shortest paths on pushdown graphs does not preserve MSO decidability. - Arnaud Carayol; Olivier Serre (Inf. Process. Lett., 2016)

C-SHORe: Higher-Order Verification via Collapsible Pushdown System Saturation. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Olivier Serre (CoRR, 2017)

Preface. - David Baelde; Arnaud Carayol; Ralph Matthes; Igor Walukiewicz (Fundam. Informaticae, 2017)

Counting branches in trees using games. - Arnaud Carayol; Olivier Serre (Inf. Comput., 2017)

An analysis of the equational properties of the well-founded fixed point. - Arnaud Carayol; Zoltán Ésik (J. Log. Algebraic Methods Program., 2017)

Optimal Strategies in Pushdown Reachability Games. - Arnaud Carayol; Matthew Hague (MFCS, 2018)

Emptiness of Stack Automata is NEXPTIME-complete: A Correction. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Olivier Serre (CoRR, 2018)

Pure Strategies in Imperfect Information Stochastic Games. - Arnaud Carayol; Christof Löding; Olivier Serre (Fundam. Informaticae, 2018)

On Long Words Avoiding Zimin Patterns. - Arnaud Carayol; Stefan Göller (Theory Comput. Syst., 2019)

Special issue - Implementation and Application of Automata (CIAA 2017). - Arnaud Carayol; Cyril Nicaud (Theor. Comput. Sci., 2019)

Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series. - Alin Bostan; Arnaud Carayol; Florent Koechlin; Cyril Nicaud (ICALP, 2020)

How Good Is a Strategy in a Game with Nature? - Arnaud Carayol; Olivier Serre (ACM Trans. Comput. Log., 2020)

Higher-order recursion schemes and their automata models. - Arnaud Carayol; Olivier Serre (Handbook of Automata Theory (II.), 2021)

Collapsible Pushdown Parity Games. - Christopher H. Broadbent; Arnaud Carayol; Matthew Hague; Andrzej S. Murawski; C.-H. Luke Ong; Olivier Serre (ACM Trans. Comput. Log., 2021)

Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. - Christopher H. Broadbent; Arnaud Carayol; C.-H. Luke Ong; Olivier Serre (ACM Trans. Comput. Log., 2021)

One Drop of Non-Determinism in a Random Deterministic Automaton. - Arnaud Carayol; Philippe Duchon; Florent Koechlin; Cyril Nicaud (STACS, 2023)

Games on Graphs. - Nathanaël Fijalkow; Nathalie Bertrand 001; Patricia Bouyer-Decitre; Romain Brenguier; Arnaud Carayol; John Fearnley; Hugo Gimbert; Florian Horn 001; Rasmus Ibsen-Jensen; Nicolas Markey; Benjamin Monmege; Petr Novotný 001; et al. (CoRR, 2023)

The Structure of Trees in the Pushdown Hierarchy. - Arnaud Carayol; Lucien Charamond (ICALP, 2024)

Random DFA With One Added Transition. - Arnaud Carayol; Philippe Duchon; Florent Koechlin; Cyril Nicaud (CoRR, 2024)

Random Deterministic Automata With One Added Transition. - Arnaud Carayol; Philippe Duchon; Florent Koechlin; Cyril Nicaud (Log. Methods Comput. Sci., 2025)