| 2024 | MCU | On the Powers of the Collatz Function. | Didier Caucal, Chlo Rispal |
| 2018 | DLT | Recognizability for Automata. | Didier Caucal, Chlo Rispal |
| 2014 | ICTAC | Context-Free Sequences. | Didier Caucal, Marion Le Gonidec |
| 2011 | FOSSACS | Regularity and Context-Freeness over Word Rewriting Systems. | Didier Caucal, Dinh Trong Hieu |
| 2009 | MFCS | Synchronization of Regular Automata. | Didier Caucal |
| 2008 | CSR | Synchronization of Grammars. | Didier Caucal, Stphane Hassen |
| 2007 | FCT | Path Algorithms on Regular Graphs. | Didier Caucal, Dinh Trong Hieu |
| 2006 | DLT | Synchronization of Pushdown Automata. | Didier Caucal |
| 2006 | MFCS | The Kleene Equality for Graphs. | Arnaud Carayol, Didier Caucal |
| 2002 | MFCS | On Infinite Terms Having a Decidable Monadic Theory. | Didier Caucal |
| 2002 | MFCS | A Chomsky-Like Hierarchy of Infinite Graphs. | Didier Caucal, Teodor Knapik |
| 2001 | MCU | On the Transition Graphs of Turing Machines. | Didier Caucal |
| 2000 | FOSSACS | On Word Rewriting Systems Having a Rational Derivation. | Didier Caucal |
| 1996 | CONCUR | Bisimulation Collapse and the Process Taxonomy. | Olaf Burkart, Didier Caucal, Bernhard Steffen |
| 1996 | ICALP | On Infinite Transition Graphs Having a Decidable Monadic Theory. | Didier Caucal |
| 1995 | MFCS | An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. | Olaf Burkart, Didier Caucal, Bernhard Steffen |
| 1992 | LICS | Monadic Theory of Term Rewritings | Didier Caucal |
| 1990 | WG | On the transition graphs of automata and grammars. | Didier Caucal, Roland Monfort |
| 1986 | STACS | Dcidabiit de l'galit des Languages Algbriques Infinitaires Simples. | Didier Caucal |