Export Publications

Exporter les publications affichées :
Nombre de documents


Publications de Didier Caucal

Article dans une revue1 document

Communication dans un congrès12 documents

  • Didier Caucal. On Cayley graphs of algebraic structures. 10th International Colloquium on Graph Theory and combinatorics (ICGT 2018), Jul 2018, Lyon, France. Discrete Mathematics and Theoretical Computer Science. 〈hal-01799928〉
  • Didier Caucal, Chloé Rispal. Recognizability for automata. DLT 2018, Sep 2018, Tokyo, Japan. 22nd International Conference on Developments in Language Theory, 11088, pp.206-218, 2018, LNCS. 〈10.1007/978-3-319-98654-8_17〉. 〈hal-01824290〉
  • Didier Caucal, Marion Le Gonidec. Context-Free Sequences. Theoretical Aspects of Computing – ICTAC 2014, Sep 2014, Bucharest, Romania. Springer, 8687, pp.259 - 276, 2014, Lecture notes in computer science. 〈http://fmi.unibuc.ro/ictac2014/〉. 〈10.1007/978-3-319-10882-7_16〉. 〈hal-01450071〉
  • Didier Caucal, Trong Hiêu Dinh. Regularity and Context-Freeness over Word Rewriting Systems. Martin Hofmann. FOSSACS 2011, Mar 2011, Saarbrücken, Germany. Springer, 6604, pp.214-228, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-19805-2_15〉. 〈hal-00867572〉
  • Didier Caucal, Teodor Knapik. Higher order indexed monadic systems. Supratik Chakraborty, Amit Kumar. FSTTCS 2011, Dec 2011, Mumbai, India. 13, pp.469-480, 2011, Leibniz International Proceedings in Informatics (LIPIcs). 〈10.4230/LIPIcs.FSTTCS.2011.469〉. 〈hal-00867571〉
  • Didier Caucal. Synchronization of Regular Automata. Rastislav Královič, Damian Niwiński. MFCS 2009, Aug 2009, Novy Smokovec, Slovakia. Springer, 5734, pp.2-23, 2009, LNCS. 〈10.1007/978-3-642-03816-7_2〉. 〈hal-00867577〉
  • Didier Caucal. Boolean algebras of unambiguous context-free languages. FSTTCS 2008, Dec 2008, Bangalore, India. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2, pp.83-94, 2008, Leibniz International Proceedings in Informatics (LIPIcs). 〈10.4230/LIPIcs.FSTTCS.2008.1743〉. 〈hal-00867574〉
  • Didier Caucal, Stéphane Hassen. Synchronization of grammars. Edward A. Hirsch,Alexander A. Razborov, Alexei Semenov, Anatol Slissenko. Third International Computer Science Symposium in Russia (CSR'08), Jun 2008, Moscou, Russia. Springer-Verlag, 5010, pp.110-121, 2008, LNCS. 〈10.1007/978-3-540-79709-8_14〉. 〈hal-00620185〉
  • Didier Caucal, Trong Hieu Dinh. Path Algorithms on Regular Graphs. Csuhaj-Varjú. FCT'07, Aug 2007, Budapest, Hungary. Springer, 4639, pp.199-212, 2007, Lecture Notes in Computer Science. 〈10.1007/978-3-540-74240-1_18〉. 〈hal-00620155〉
  • Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter. Efficient Computation of Throughput Values of Context-Free Languages. Holub Jan and Zdárek Jan. 12th International Conference on Implementation and Application of Automata (CIAA'07), Jul 2007, Prague, Czech Republic. Springer, 4783, pp.203-213, 2007, LNCS. 〈10.1007/978-3-540-76336-9_20〉. 〈hal-00620156〉
  • Arnaud Carayol, Didier Caucal. The Kleene Equality for Graphs. Kralovic Rastislav and Urzyczyn Pawel. 31st International Symposium on Mathematical Foundations of Computer Science (MFCS'06), Aug 2006, Stará Lesná, Slovakia. Springer-Verlag, 4162, pp.214-225, 2006, LNCS. 〈10.1007/11821069_19〉. 〈hal-00620173〉
  • Didier Caucal. Synchronization of Pushdown Automata. Ibarra Oscar and Dang Zhe. DLT'06, Jun 2006, Santa Barbara, CA, United States. Springer, 4036, pp.120-132, 2006, Lecture Notes in Computer Science. 〈10.1007/11779148_12〉. 〈hal-00620158〉

Chapitre d'ouvrage1 document

  • 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〉

Direction d'ouvrage, Proceedings, Dossier1 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〉

Pré-publication, Document de travail2 documents

  • Didier Caucal, Chloé Rispal. Boolean algebras by length recognizability. 2019. 〈hal-02012291〉
  • Didier Caucal. Cayley graphs of algebraic structures. submission to a journal. 2018. 〈hal-01909189〉

Rapport9 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. 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. Les graphes à motifs. [Rapport de recherche] RR-0958, INRIA. 1988. 〈inria-00075601〉
  • 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〉