| Verification on infinite structures O Burkart, D Caucal, F Moller, B Steffen Handbook of Process algebra, 545-623, 2001 | 268 | 2001 |
| On the regular structure of prefix rewriting D Caucal Theoretical Computer Science 106 (1), 61-86, 1992 | 224 | 1992 |
| On infinite transition graphs having a decidable monadic theory D Caucal International Colloquium on Automata, Languages, and Programming, 194-205, 1996 | 192 | 1996 |
| On infinite terms having a decidable monadic theory D Caucal International Symposium on Mathematical Foundations of Computer Science, 165-176, 2002 | 183 | 2002 |
| Graphes canoniques de graphes algébriques D Caucal RAIRO-Theoretical Informatics and Applications 24 (4), 339-352, 1990 | 134 | 1990 |
| An elementary bisimulation decision procedure for arbitrary context-free processes O Burkart, D Caucal, B Steffen Mathematical Foundations of Computer Science 1995: 20th International …, 1995 | 114 | 1995 |
| On infinite transition graphs having a decidable monadic theory D Caucal Theoretical Computer Science 290 (1), 79-115, 2003 | 84 | 2003 |
| Bisimulation collapse and the process taxonomy O Burkart, D Caucal, B Steffen CONCUR'96: Concurrency Theory: 7th International Conference Pisa, Italy …, 1996 | 74 | 1996 |
| On the regular structure of prefix rewriting D Caucal Colloquium on Trees in Algebra and Programming, 87-102, 1990 | 64 | 1990 |
| On the transition graphs of automata and grammars D Caucal, R Monfort International Workshop on Graph-Theoretic Concepts in Computer Science, 311-337, 1990 | 51 | 1990 |
| Synchronization of pushdown automata D Caucal Developments in Language Theory: 10th International Conference, DLT 2006 …, 2006 | 39 | 2006 |
| Bisimulation of context-free grammars and of pushdown automata D Caucal Modal Logic and process algebra 53, 85-106, 1995 | 37 | 1995 |
| Deterministic graph grammars. D Caucal Logic and Automata 2, 169-250, 2008 | 29 | 2008 |
| On word rewriting systems having a rational derivation D Caucal International Conference on Foundations of Software Science and Computation …, 2000 | 27 | 2000 |
| An internal presentation of regular graphs by prefix-recognizable graphs D Caucal, T Knapik Theory of Computing Systems 34 (4), 299-336, 2001 | 25 | 2001 |
| A fast algorithm to decide on simple grammars equivalence D Caucal International Symposium on Optimal Algorithms, 66-85, 1989 | 21 | 1989 |
| Synchronization of grammars D Caucal, S Hassen Computer Science–Theory and Applications: Third International Computer …, 2008 | 20 | 2008 |
| A Chomsky-like hierarchy of infinite graphs D Caucal, T Knapik Mathematical Foundations of Computer Science 2002: 27th International …, 2002 | 19 | 2002 |
| On the transition graphs of Turing machines D Caucal International Conference on Machines, Computations, and Universality, 177-189, 2001 | 19 | 2001 |
| Verification over infinite states O Burkart, D Caucal, F Moller, B Steffen Handbook of Process Algebra, 545-623, 2001 | 19 | 2001 |
