Skip to Main content

Export Publications

Export the displayed publications:
Number of documents


Didier Caucal's publications

Journal articles2 documents

  • Didier Caucal. Cayley graphs of basic algebraic structures. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2020, vol. 21 no. 1, ICGT 2018. ⟨hal-01909189v4⟩
  • Didier Caucal, Teodor Knapik. Shelah-Stupp's iteration and Muchnik's iteration. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2018, 159 (4), pp.327-359. ⟨10.3233/FI-2018-1667⟩. ⟨hal-01676771v2⟩

Conference papers12 documents

Book sections2 documents

  • Didier Caucal, Chloé Rispal. Boolean algebras by length recognizability. Lecture Notes in Computer Science, 11200, Springer, pp.169-185, 2019, Models, Mindsets, Meta: The What, the How, and the Why Not?, ⟨10.1007/978-3-030-22348-9_11⟩. ⟨hal-02012291⟩
  • Didier Caucal. Deterministic graph grammars. Jörg Flum, Erich Grädel, Thomas Wilke. Logic and Automata - History and Perspectives, Amsterdam University Press, pp.169-250, 2008, Texts in Logic and Games, 9789053565766. ⟨hal-00867578⟩

Directions of work or proceedings1 document

  • Didier Caucal, Anne Siegel. Special Issue: Journées Montoises d'informatique théorique (Rennes, 2006). Caucal, Didier and Siegel, Anne. RAIRO - Theoretical Informatics and Applications 42(3), RAIRO - Theoretical Informatics and Applications, EDP Sciences, pp.240, 2008. ⟨inria-00330569⟩

Preprints, Working Papers, ...1 document

Reports9 documents

  • Didier Caucal, Dung Huynh, Lu Tian. Branching bisimulation for context-free processes. [Research Report] RR-1789, INRIA. 1992. ⟨inria-00077029⟩
  • Didier Caucal. Elimination of redundancy from functions defined by schemes. [Research Report] RR-1429, INRIA. 1991. ⟨inria-00075131⟩
  • Didier Caucal, Roland Monfort. On the transition graphs of automata and grammars. [Research Report] RR-1318, INRIA. 1990. ⟨inria-00075241⟩
  • Didier Caucal. On the regular structure of prefix rewritings. [Research Report] RR-1196, INRIA. 1990. ⟨inria-00075362⟩
  • Didier Caucal. Les graphes à motifs. [Rapport de recherche] RR-0958, INRIA. 1988. ⟨inria-00075601⟩
  • Didier Caucal. Graphes canoniques de graphes algébriques. [Rapport de recherche] RR-0872, INRIA. 1988. ⟨inria-00075682⟩
  • Didier Caucal. Récritures suffixes de mots. [Rapport de recherche] RR-0871, INRIA. 1988. ⟨inria-00075683⟩
  • Didier Caucal. How to improve branching algorithms for deciding on grammars equivalence. [Research Report] RR-0618, INRIA. 1987. ⟨inria-00075936⟩
  • Didier Caucal. Algorithme optimal de décision pour l'équivalence des grammaires simples. [Rapport de recherche] RR-0344, INRIA. 1984. ⟨inria-00076213⟩