 | 2008 |
|---|
| 15 |       | Arnaud Carayol,
Matthew Hague,
Antoine Meyer,
C.-H. Luke Ong,
Olivier Serre:
Winning Regions of Higher-Order Pushdown Games.
LICS 2008: 193-204 |
| 14 | | Arnaud Carayol,
Michaela Slaats:
Positional Strategies for Higher-Order Pushdown Parity Games.
MFCS 2008: 217-228 |
| 2007 |
|---|
| 13 | | Arnaud Carayol,
Christof Löding:
MSO on the Infinite Binary Tree: Choice and Order.
CSL 2007: 161-176 |
| 12 | | Arnaud Carayol,
Antoine Meyer:
Linearly bounded infinite graphs
CoRR abs/0705.3487: (2007) |
| 2006 |
|---|
| 11 | | Arnaud Carayol,
Christophe Morvan:
On Rational Trees.
CSL 2006: 225-239 |
| 10 | | Arnaud Carayol,
Didier Caucal:
The Kleene Equality for Graphs.
MFCS 2006: 214-225 |
| 9 | | Arnaud Carayol,
Antoine Meyer:
Linearly bounded infinite graphs.
Acta Inf. 43(4): 265-292 (2006) |
| 8 | | Arnaud Carayol,
Antoine Meyer:
Context-Sensitive Languages, Rational Graphs and Determinism
CoRR abs/cs/0606053: (2006) |
| 7 | | Arnaud Carayol,
Antoine Meyer:
Context-Sensitive Languages, Rational Graphs and Determinism.
Logical Methods in Computer Science 2(2): (2006) |
| 2005 |
|---|
| 6 | | Arnaud Carayol:
Regular Sets of Higher-Order Pushdown Stacks.
MFCS 2005: 168-179 |
| 5 | | Arnaud Carayol,
Antoine Meyer:
Linearly Bounded Infinite Graphs.
MFCS 2005: 180-191 |
| 4 | | Arnaud Carayol,
Daniel Hirschkoff,
Davide Sangiorgi:
On the representation of McCarthy's amb in the Pi-calculus.
Theor. Comput. Sci. 330(3): 439-473 (2005) |
| 2004 |
|---|
| 3 | | Arnaud Carayol,
Daniel Hirschkoff,
Davide Sangiorgi:
On the Representation of McCarthy's amb in the -calculus.
Electr. Notes Theor. Comput. Sci. 96: 73-89 (2004) |
| 2003 |
|---|
| 2 | | Arnaud Carayol,
Stefan Wöhrle:
The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata.
FSTTCS 2003: 112-123 |
| 1 | | Arnaud Carayol,
Thomas Colcombet:
On Equivalent Representations of Infinite Structures.
ICALP 2003: 599-610 |
