| The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata A Carayol, S Wöhrle FST TCS 2003: Foundations of Software Technology and Theoretical Computer …, 2003 | 155 | 2003 |
| Recursion schemes and logical reflection CH Broadbent, A Carayol, CHL Ong, O Serre 2010 25th Annual IEEE Symposium on Logic in Computer Science, 120-129, 2010 | 69 | 2010 |
| Collapsible pushdown automata and labeled recursion schemes: Equivalence, safety and effective selection A Carayol, O Serre 2012 27th Annual IEEE Symposium on Logic in Computer Science, 165-174, 2012 | 51 | 2012 |
| Regular sets of higher-order pushdown stacks A Carayol Mathematical Foundations of Computer Science 2005: 30th International …, 2005 | 49 | 2005 |
| A saturation method for collapsible pushdown systems C Broadbent, A Carayol, M Hague, O Serre International Colloquium on Automata, Languages, and Programming, 165-176, 2012 | 46 | 2012 |
| Winning regions of higher-order pushdown games A Carayol, M Hague, A Meyer, CHL Ong, O Serre 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 193-204, 2008 | 44 | 2008 |
| MSO on the infinite binary tree: Choice and order A Carayol, C Löding International Workshop on Computer Science Logic, 161-176, 2007 | 43 | 2007 |
| Choice functions and well-orderings over the infinite binary tree A Carayol, C Löding, D Niwinski, I Walukiewicz Open Mathematics 8 (4), 662-682, 2010 | 41 | 2010 |
| C-shore: a collapsible approach to higher-order verification C Broadbent, A Carayol, M Hague, O Serre ACM SIGPLAN Notices 48 (9), 13-24, 2013 | 36 | 2013 |
| Uniformization in automata theory A Carayol, C Löding Proceedings of the 14th Congress of Logic, Methodology and Philosophy of …, 2011 | 31 | 2011 |
| On the representation of McCarthy's amb in the π-calculus A Carayol, D Hirschkoff, D Sangiorgi Theoretical computer science 330 (3), 439-473, 2005 | 31 | 2005 |
| Randomization in automata on infinite trees A Carayol, A Haddad, O Serre ACM Transactions on Computational Logic (TOCL) 15 (3), 1-33, 2014 | 29 | 2014 |
| Distribution of the number of accessible states in a random deterministic automaton A Carayol, C Nicaud STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 194-205, 2012 | 28 | 2012 |
| Context-sensitive languages, rational graphs and determinism A Carayol, A Meyer Logical Methods in Computer Science 2, 2006 | 24 | 2006 |
| Linear orders in the pushdown hierarchy L Braud, A Carayol International Colloquium on Automata, Languages, and Programming, 88-99, 2010 | 22 | 2010 |
| Games on graphs N Fijalkow, N Bertrand, P Bouyer-Decitre, R Brenguier, A Carayol, ... arXiv preprint arXiv:2305.10546, 2023 | 20 | 2023 |
| Saturation algorithms for model-checking pushdown systems A Carayol, M Hague arXiv preprint arXiv:1405.5593, 2014 | 18 | 2014 |
| Automates infinis, logiques et langages A Carayol Université Rennes 1, 2006 | 18 | 2006 |
| On rational trees A Carayol, C Morvan International Workshop on Computer Science Logic, 225-239, 2006 | 16 | 2006 |
| On equivalent representations of infinite structures A Carayol, T Colcombet International Colloquium on Automata, Languages, and Programming, 599-610, 2003 | 16 | 2003 |
