- 9
- 5
- 5
- 3
- 2
- 2
- 1
Didier Caucal
27
Documents
Présentation
Publications
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 17
- 8
- 1
- 1
- 1
- 1
- 2
- 1
- 3
- 1
- 2
- 1
- 4
- 2
- 2
- 1
- 1
- 2
- 3
- 1
- 1
|
|
Cayley graphs of basic algebraic structuresDiscrete Mathematics and Theoretical Computer Science, 2020, vol. 21 no. 1, ICGT 2018, ⟨10.23638/DMTCS-21-1-16⟩
Article dans une revue
hal-01909189v4
|
|
|
Shelah-Stupp's iteration and Muchnik's iterationFundamenta Informaticae, 2018, 159 (4), pp.327-359. ⟨10.3233/FI-2018-1667⟩
Article dans une revue
hal-01676771v2
|
|
|
On Cayley graphs of algebraic structures10th International Colloquium on Graph Theory and combinatorics (ICGT 2018), Jul 2018, Lyon, France
Communication dans un congrès
hal-01799928v1
|
|
|
Recognizability for automataDLT 2018, Sep 2018, Tokyo, Japan. pp.206-218, ⟨10.1007/978-3-319-98654-8_17⟩
Communication dans un congrès
hal-01824290v1
|
|
|
Context-Free SequencesTheoretical Aspects of Computing – ICTAC 2014, Gabriel Ciobanu, Dominique Méry Sep 2014, Bucharest, Romania. pp.259 - 276, ⟨10.1007/978-3-319-10882-7_16⟩
Communication dans un congrès
hal-01450071v1
|
|
|
Higher order indexed monadic systemsFSTTCS 2011, Dec 2011, Mumbai, India. pp.469-480, ⟨10.4230/LIPIcs.FSTTCS.2011.469⟩
Communication dans un congrès
hal-00867571v1
|
|
|
Regularity and Context-Freeness over Word Rewriting SystemsFOSSACS 2011, Mar 2011, Saarbrücken, Germany. pp.214-228, ⟨10.1007/978-3-642-19805-2_15⟩
Communication dans un congrès
hal-00867572v1
|
|
|
Synchronization of Regular AutomataMFCS 2009, Aug 2009, Novy Smokovec, Slovakia. pp.2-23, ⟨10.1007/978-3-642-03816-7_2⟩
Communication dans un congrès
hal-00867577v1
|
|
|
Synchronization of grammarsThird International Computer Science Symposium in Russia (CSR'08), Jun 2008, Moscou, Russia. pp.110-121, ⟨10.1007/978-3-540-79709-8_14⟩
Communication dans un congrès
hal-00620185v1
|
|
|
Boolean algebras of unambiguous context-free languagesFSTTCS 2008, Dec 2008, Bangalore, India. pp.83-94, ⟨10.4230/LIPIcs.FSTTCS.2008.1743⟩
Communication dans un congrès
hal-00867574v1
|
|
|
Path Algorithms on Regular GraphsFCT'07, Aug 2007, Budapest, Hungary. pp.199-212, ⟨10.1007/978-3-540-74240-1_18⟩
Communication dans un congrès
hal-00620155v1
|
|
|
Efficient Computation of Throughput Values of Context-Free Languages12th International Conference on Implementation and Application of Automata (CIAA'07), Jul 2007, Prague, Czech Republic. pp.203-213, ⟨10.1007/978-3-540-76336-9_20⟩
Communication dans un congrès
hal-00620156v1
|
|
|
Synchronization of Pushdown AutomataDLT'06, Jun 2006, Santa Barbara, CA, United States. pp.120-132, ⟨10.1007/11779148_12⟩
Communication dans un congrès
hal-00620158v1
|
|
|
The Kleene Equality for Graphs31st International Symposium on Mathematical Foundations of Computer Science (MFCS'06), Aug 2006, Stará Lesná, Slovakia. pp.214-225, ⟨10.1007/11821069_19⟩
Communication dans un congrès
hal-00620173v1
|
Special Issue: Journées Montoises d'informatique théorique (Rennes, 2006)Caucal, Didier and Siegel, Anne. RAIRO - Theoretical Informatics and Applications, EDP Sciences, RAIRO - Theoretical Informatics and Applications 42(3), pp.240, 2008
Ouvrages
inria-00330569v1
|
|
|
Boolean algebras by length recognizabilityLecture 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⟩
Chapitre d'ouvrage
hal-02012291v1
|
|
|
Deterministic graph grammarsJö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
Chapitre d'ouvrage
hal-00867578v1
|
|
|
Cayley graphs of basic algebraic structures2020
Pré-publication, Document de travail
hal-02517388v1
|