Publications

All my publications can be also found on the DBLP server.

Journals

• Linearly Bounded Infinite Graphs [pdf]
  A. Carayol et A. Meyer in Acta Informatica, vol 43(4):265--292, 2006.
• Context-Sensitive Languages, Rational Graphs and Determinism [pdf | link]
  A. Carayol et A. Meyer in Logical Method in Computer Science, vol 2(2), 2006.
• On the representation of McCarthy's amb in the Pi-calculus [pdf]
  A. Carayol, D. Hirschkoff et D. Sangiorgi in Theoretical Computer Science, vol 330(3):439--473, 2005.

Conferences

• Winning Regions of Higher-Order Pushdown Games.[pdf]
  Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong and Olivier Serre in Proceedings of IEEE Symposium on Logic in Computer Science (LICS 2008), 2008. p. 193-204.
• Positional Strategies for Higher-Order Pushdown Parity Games.[pdf]
  Arnaud Carayol, Michaela Slaats in Proceedings of Mathematical Foundations of Computer Science (MFCS 2008),2008. LNCS vol. 5162 ,p. 217-228.
• MSO on the Infinite Binary Tree: Choice and Order [pdf]
  Arnaud Carayol and Christof Löding in ProceedingsAnnual Conference of the EACSL (CSL 2007), 2007. LNCS vol. 4646, p. 161-176.
• On rational trees [pdf]
  A. Carayol et C. Morvan in Proceedings of Annual Conference of the EACSL (CSL 2006), 2006. LNCS vol. 4207, p. 225-239.
• Kleene equality for graphs [pdf]
  A. Carayol et D. Caucal in Proceedings of Mathematical Foundations of Computer Science (MFCS 2006), 2006. LNCS vol. 4162, p. 214-225.
• Regular Sets of Higher-Order Pushdown Stacks [pdf]
  A. Carayol in Proceedings of Mathematical Foundations of Computer Science (MFCS 2005),2005. LNCS vol. 3618, p. 168-179.
• Linearly Bounded Infinite Graphs [pdf]
  A. Carayol et A. Meyer in Proceedings of Mathematical Foundations of Computer Science (MFCS 2005), 2005. LNCS vol. 3618, p. 180-191.
• The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata [pdf]
  A. Carayol et S. Woerhle in Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2003), 2003. LNCS vol. 2914, p. 112-123.
• On Equivalent Representations of Infinite Structures [pdf]
  A. Carayol et T. Colcombet in Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP 2003), 2003. LNCS vol. 2719, p. 599-610.

Workshop

• On the representation of McCarthy's amb in the Pi-calculus [pdf]
  A. Carayol, D. Hirschkoff and D. Sangiorgi in Proceedings of the International Workshop on Expressiveness in Concurrency (EXPRESS 2003), 2003. ENTCS vol. 96 p. 73-89.

PhD Thesis (in french)

• Automates infinis, logiques et langages [pdf]
  PhD thesis, IFSIC, Université de Rennes 1, 2006.