10 citations · 36 across the 15 of their papers we have counts for
9 papers · 1 filter
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…
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…
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…
Emptiness of Stack Automata is NEXPTIME-complete: A Correction
Christopher Broadbent, Arnaud Carayol, Matthew Hague +1
A saturation algorithm for collapsible pushdown systems was published in ICALP 2012. This work introduced a class of stack automata used to recognised regular sets of collapsible p…
Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability
Arnaud Carayol, Olivier Serre
In this paper we consider pushdown graphs, i.e. infinite graphs that can be described as transition graphs of deterministic real-time pushdown automata. We consider the case where…
Pure Strategies in Imperfect Information Stochastic Games
Arnaud Carayol, Christof Löding, Olivier Serre
We consider imperfect information stochastic games where we require the players to use pure (i.e. non randomised) strategies. We consider reachability, safety, Büchi and co-Büchi o…