10 citations · 36 across the 15 of their papers we have counts for
17 papers
Weakly-unambiguous Parikh automata and their link to holonomic series
Alin Bostan, Arnaud Carayol, Florent Koechlin +1
We investigate the connection between properties of formal languages and properties of their generating series, with a focus on the class of holonomic power series. We first prove…
Games on Graphs: From Logic and Automata to Algorithms
Nathanaël Fijalkow, C. Aiswarya, Guy Avni +22
The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared…
Collapsible Pushdown Parity Games
Christopher H. Broadbent, Arnaud Carayol, Matthew Hague +3
This paper studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely those generated by collapsible pushdown automata. The main mot…
Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties
Christopher H. Broadbent, Arnaud Carayol, C. -H. Luke Ong +1
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic…
How Good Is a Strategy in a Game With Nature?
Arnaud Carayol, Olivier Serre
We consider games with two antagonistic players --- Éloïse (modelling a program) and Abélard (modelling a byzantine environment) --- and a third, unpredictable and uncontrollable p…
On long words avoiding Zimin patterns
Arnaud Carayol, Stefan Göller
A pattern is encountered in a word if some infix of the word is the image of the pattern under some non-erasing morphism. A pattern is unavoidable if, over every finite alphabe…