Search Results - "Carayol Arnaud"

Saturation algorithms for model-checking pushdown systems by Carayol, Arnaud, Hague, Matthew

“…We present a survey of the saturation method for model-checking pushdown systems…”
Get full text

Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection by Carayol, A., Serre, O.

“…Higher-order recursion schemes are rewriting systems for simply typed terms and they are known to be equi-expressive with collapsible pushdown automata (CPDA)…”
Get full text

Choice functions and well-orderings over the infinite binary tree by Carayol Arnaud, Löding Christof, Niwinski Damian, Walukiewicz Igor

Get full text

Context-Sensitive Languages, Rational Graphs and Determinism by Carayol, Arnaud, Meyer, Antoine

“…We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and…”
Get full text

Counting branches in trees using games by Carayol, Arnaud, Serre, Olivier

“…We study finite automata running over infinite binary trees. A run of such an automaton is usually said to be accepting if all its branches are accepting. In…”
Get full text

On Long Words Avoiding Zimin Patterns by Carayol, Arnaud, Göller, Stefan

“…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 p is unavoidable if, over…”
Get full text

An analysis of the equational properties of the well-founded fixed point by Carayol, Arnaud, Ésik, Zoltán

“…Well-founded fixed points have been used in several areas of knowledge representation and reasoning and in particular to give semantics to logic programs…”
Get full text

How Good Is a Strategy in a Game with Nature? by Carayol, Arnaud, Serre, Olivier

“…We consider games with two antagonistic players -- Éloïse (modelling a program) and Abelard (modelling a byzantine environment) -- and a third, unpredictable…”
Get full text

Marking shortest paths on pushdown graphs does not preserve MSO decidability by Carayol, Arnaud, Serre, Olivier

“…•We consider pushdown graphs where some vertices are designated as being final.•We built, in a breadth-first manner, a marking of edges leading to final…”
Get full text

The FC-rank of a context-free language by Carayol, Arnaud, Ésik, Zoltán

“…We prove that the finite condensation rank (FC-rank) of the lexicographic ordering of a context-free language is strictly less than ωω…”
Get full text

Proceedings Workshop on Fixed Points in Computer Science: Preface by Baelde, David, Carayol, Arnaud

Get full text

An analysis of the equational properties of the well-founded fixed point by Carayol, Arnaud, Ésik, Zoltán

Get full text

Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings by Carayol, Arnaud, Loding, Christof, Serre, Olivier

“…This article is inspired by two works from the early 90s. The first one is by Bogaert and Tison who considered a model of automata on finite ranked trees where…”
Get full text

Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings by Carayol, Arnaud, Löding, Christof, Serre, Olivier

“…This article is inspired by two works from the early 90s. The first one is by Bogaert and Tison who considered a model of automata on finite ranked trees where…”
Get full text

How Good Is a Strategy in a Game With Nature? by Carayol, Arnaud, Serre, Olivier

“…ACM Transactions on Computational Logic, Vol. 21, No 3, Article 21, pp. 1-39, February 2020 We consider games with two antagonistic players --- \'Elo\"ise…”
Get full text

Recursion Schemes and Logical Reflection by Broadbent, Christopher H, Carayol, Arnaud, Ong, C.-H Luke, Serre, Olivier

“…Let R be a class of generators of node-labelled infinite trees, and Lbe a logical language for describing correctness properties of the setrees. Given r in R…”
Get full text

Random Deterministic Automata With One Added Transition by Carayol, Arnaud, Duchon, Philippe, Koechlin, Florent, Nicaud, Cyril

“…Every language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the…”
Get full text

Linearly bounded infinite graphs by CARAYOL, Arnaud, MEYER, Antoine

“…Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata…”
Get full text

On long words avoiding Zimin patterns by Carayol, Arnaud, Göller, Stefan

“…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 $p$ is unavoidable if, over…”
Get full text

Marking Shortest Paths On Pushdown Graphs Does Not Preserve MSO Decidability by Carayol, Arnaud, Serre, Olivier

“…Information Processing Letters, Elsevier, 2016, 116 (10), pp.638-643 In this paper we consider pushdown graphs, i.e. infinite graphs that can be described as…”
Get full text