Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples. - Didier Caucal (STACS, 1986)

A Fast Algorithm to Decide on Simple Grammars Equivalence. - Didier Caucal (Optimal Algorithms, 1989)

An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes. - Didier Caucal (Graph-Grammars and Their Application to Computer Science, 1990)

On the transition graphs of automata and grammars. - Didier Caucal; Roland Monfort (WG, 1990)

Graphes canoniques de graphes algébriques. - Didier Caucal (RAIRO Theor. Informatics Appl., 1990)

Branching Bisimulation for Context-free Processes. - Didier Caucal (FSTTCS, 1992)

Monadic Theory of Term Rewritings - Didier Caucal (LICS, 1992)

On the Regular Structure of Prefix Rewriting. - Didier Caucal (Theor. Comput. Sci., 1992)

A Fast Algorithm to Decide on the Equivalence of Stateless DPDA. - Didier Caucal (RAIRO Theor. Informatics Appl., 1993)

An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. - Olaf Burkart; Didier Caucal; Bernhard Steffen (MFCS, 1995)

Deciding Branching Bimiliarity of Normed Context-Free Processes Is in Sigma^ p_2 - Didier Caucal; Dung T. Huynh; Lu Tian (Inf. Comput., 1995)

Bisimulation Collapse and the Process Taxonomy. - Olaf Burkart; Didier Caucal; Bernhard Steffen (CONCUR, 1996)

On Word Rewriting Systems Having a Rational Derivation. - Didier Caucal (FoSSaCS, 2000)

Verification on Infinite Structures. - Olaf Burkart; Didier Caucal; Faron Moller; Bernhard Steffen (Handbook of Process Algebra, 2001)

An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs. - Didier Caucal; Teodor Knapik (Theory Comput. Syst., 2001)

On Infinite Terms Having a Decidable Monadic Theory. - Didier Caucal (MFCS, 2002)

A Chomsky-Like Hierarchy of Infinite Graphs. - Didier Caucal; Teodor Knapik (MFCS, 2002)

On infinite transition graphs having a decidable monadic theory. - Didier Caucal (Theor. Comput. Sci., 2003)

On the transition graphs of turing machines. - Didier Caucal (Theor. Comput. Sci., 2003)

Synchronization of Pushdown Automata. - Didier Caucal (Developments in Language Theory, 2006)

The Kleene Equality for Graphs. - Arnaud Carayol; Didier Caucal (MFCS, 2006)

Path Algorithms on Regular Graphs. - Didier Caucal; Dinh Trong Hieu (FCT, 2007)

Efficient Computation of Throughput Values of Context-Free Languages. - Didier Caucal; Jurek Czyzowicz; Wojciech Fraczak; Wojciech Rytter (CIAA, 2007)

Deterministic graph grammars. - Didier Caucal (Logic and Automata, 2008)

Synchronization of Grammars. - Didier Caucal; Stéphane Hassen (CSR, 2008)

Boolean algebras of unambiguous context-free languages. - Didier Caucal (FSTTCS, 2008)

Preface. - Didier Caucal; Anne Siegel (RAIRO Theor. Informatics Appl., 2008)

Synchronization of Regular Automata. - Didier Caucal (MFCS, 2009)

Regularity and Context-Freeness over Word Rewriting Systems. - Didier Caucal; Dinh Trong Hieu (FoSSaCS, 2011)

Higher order indexed monadic systems. - Didier Caucal; Teodor Knapik (FSTTCS, 2011)

Context-Free Sequences. - Didier Caucal; Marion Le Gonidec (ICTAC, 2014)

Structural characterization of Cayley graphs. - Didier Caucal (CoRR, 2016)

Boolean Algebras by Length Recognizability. - Didier Caucal; Chloé Rispal (Models, Mindsets, Meta, 2018)

Recognizability for Automata. - Didier Caucal; Chloé Rispal (DLT, 2018)

On Cayley graphs of algebraic structures. - Didier Caucal (CoRR, 2018)

Shelah-Stupp's Iteration and Muchnik's Iteration. - Didier Caucal; Teodor Knapik (Fundam. Informaticae, 2018)

Cayley graphs of basic algebraic structures. - Didier Caucal (Discret. Math. Theor. Comput. Sci., 2019)

Synchronizable functions on integers. - Didier Caucal; Chloé Rispal (CoRR, 2022)

On the Powers of the Collatz Function. - Didier Caucal; Chloé Rispal (MCU, 2024)