Arnaud Carayol

Available identifiers

zbMath Open carayol.arnaudMaRDI QIDQ347387

List of research outcomes

Publication	Date of Publication	Type
One drop of non-determinism in a random deterministic automaton	2024-10-08	Paper
Higher-order recursion schemes and their automata models	2021-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q5005144	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4994932	2021-06-22	Paper
How Good Is a Strategy in a Game with Nature?	2020-09-11	Paper
On long words avoiding Zimin patterns	2019-08-27	Paper
Pure Strategies in Imperfect Information Stochastic Games	2018-10-26	Paper
How Good Is a Strategy in a Game with Nature?	2018-04-23	Paper
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings	2018-04-23	Paper
On Long Words Avoiding Zimin Patterns	2018-04-19	Paper
Erratum for “Randomization in Automata on Infinite Trees”	2017-07-12	Paper
https://portal.mardi4nfdi.de/entity/Q5271416	2017-07-11	Paper
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection	2017-05-16	Paper
Counting branches in trees using games	2016-12-22	Paper
An analysis of the equational properties of the well-founded fixed point	2016-11-30	Paper
Marking shortest paths on pushdown graphs does not preserve MSO decidability	2016-07-07	Paper
Regular Strategies in Pushdown Reachability Games	2015-10-28	Paper
Randomization in Automata on Infinite Trees	2015-09-17	Paper
C-SHORe	2015-03-30	Paper
On the representation of McCarthy's amb in the \(\pi\)-calculus	2013-09-09	Paper
The FC-rank of a context-free language	2013-06-28	Paper
A Saturation Method for Collapsible Pushdown Systems	2012-11-01	Paper
Algebraic Synchronization Trees and Processes	2012-11-01	Paper
A Context-Free Linear Ordering with an Undecidable First-Order Theory	2012-09-21	Paper
Distribution of the number of accessible states in a random deterministic automaton	2012-08-23	Paper
Choice functions and well-orderings over the infinite binary tree	2010-11-22	Paper
Linear Orders in the Pushdown Hierarchy	2010-09-07	Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science	2009-08-06	Paper
On Rational Trees	2009-03-12	Paper
MSO on the Infinite Binary Tree: Choice and Order	2009-03-05	Paper
Positional Strategies for Higher-Order Pushdown Parity Games	2009-02-03	Paper
Context-Sensitive Languages, Rational Graphs and Determinism	2007-10-11	Paper
The Kleene Equality for Graphs	2007-09-05	Paper
Linearly bounded infinite graphs	2006-11-27	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper
On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus	2005-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q4449206	2004-02-08	Paper

Research outcomes over time

This page was built for person: Arnaud Carayol