Didier Caucal

27
Documents

Présentation

Publications

9
5
5
3
2
2
1
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
1
1
2
1
3
1
2
1
4
2
2
1
1
2
3
1
1
15
8
2
1
1

Publications

Deposit thumbnail

Cayley graphs of basic algebraic structures

Didier Caucal

Discrete Mathematics and Theoretical Computer Science, 2020, vol. 21 no. 1, ICGT 2018, ⟨10.23638/DMTCS-21-1-16⟩

Article dans une revue hal-01909189v4
Deposit thumbnail

Shelah-Stupp's iteration and Muchnik's iteration

Didier Caucal , Teodor Knapik

Fundamenta Informaticae, 2018, 159 (4), pp.327-359. ⟨10.3233/FI-2018-1667⟩

Article dans une revue hal-01676771v2
Deposit thumbnail

Recognizability for automata

Didier Caucal , Chloé Rispal

DLT 2018, Sep 2018, Tokyo, Japan. pp.206-218, ⟨10.1007/978-3-319-98654-8_17⟩

Communication dans un congrès hal-01824290v1
Deposit thumbnail

On Cayley graphs of algebraic structures

Didier Caucal

10th International Colloquium on Graph Theory and combinatorics (ICGT 2018), Jul 2018, Lyon, France

Communication dans un congrès hal-01799928v1
Deposit thumbnail

Context-Free Sequences

Didier Caucal , Marion Le Gonidec

Theoretical 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
Deposit thumbnail

Higher order indexed monadic systems

Didier Caucal , Teodor Knapik

FSTTCS 2011, Dec 2011, Mumbai, India. pp.469-480, ⟨10.4230/LIPIcs.FSTTCS.2011.469⟩

Communication dans un congrès hal-00867571v1
Deposit thumbnail

Regularity and Context-Freeness over Word Rewriting Systems

Didier Caucal , Trong Hiêu Dinh

FOSSACS 2011, Mar 2011, Saarbrücken, Germany. pp.214-228, ⟨10.1007/978-3-642-19805-2_15⟩

Communication dans un congrès hal-00867572v1
Deposit thumbnail

Synchronization of Regular Automata

Didier Caucal

MFCS 2009, Aug 2009, Novy Smokovec, Slovakia. pp.2-23, ⟨10.1007/978-3-642-03816-7_2⟩

Communication dans un congrès hal-00867577v1
Deposit thumbnail

Boolean algebras of unambiguous context-free languages

Didier Caucal

FSTTCS 2008, Dec 2008, Bangalore, India. pp.83-94, ⟨10.4230/LIPIcs.FSTTCS.2008.1743⟩

Communication dans un congrès hal-00867574v1
Deposit thumbnail

Synchronization of grammars

Didier Caucal , Stéphane Hassen

Third 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
Deposit thumbnail

Efficient Computation of Throughput Values of Context-Free Languages

Didier Caucal , Jurek Czyzowicz , Wojciech Fraczak , Wojciech Rytter

12th 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
Deposit thumbnail

Path Algorithms on Regular Graphs

Didier Caucal , Trong Hieu Dinh

FCT'07, Aug 2007, Budapest, Hungary. pp.199-212, ⟨10.1007/978-3-540-74240-1_18⟩

Communication dans un congrès hal-00620155v1
Deposit thumbnail

The Kleene Equality for Graphs

Arnaud Carayol , Didier Caucal

31st 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
Deposit thumbnail

Synchronization of Pushdown Automata

Didier Caucal

DLT'06, Jun 2006, Santa Barbara, CA, United States. pp.120-132, ⟨10.1007/11779148_12⟩

Communication dans un congrès hal-00620158v1

Special Issue: Journées Montoises d'informatique théorique (Rennes, 2006)

Didier Caucal , Anne Siegel

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
Deposit thumbnail

Boolean algebras by length recognizability

Didier Caucal , Chloé Rispal

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⟩

Chapitre d'ouvrage hal-02012291v1
Deposit thumbnail

Deterministic graph grammars

Didier Caucal

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

Chapitre d'ouvrage hal-00867578v1
Deposit thumbnail

Branching bisimulation for context-free processes

Didier Caucal , Dung Huynh , Lu Tian

[Research Report] RR-1789, INRIA. 1992

Rapport (rapport de recherche) inria-00077029v1
Deposit thumbnail

Elimination of redundancy from functions defined by schemes

Didier Caucal

[Research Report] RR-1429, INRIA. 1991

Rapport (rapport de recherche) inria-00075131v1
Deposit thumbnail

On the transition graphs of automata and grammars

Didier Caucal , Roland Monfort

[Research Report] RR-1318, INRIA. 1990

Rapport (rapport de recherche) inria-00075241v1
Deposit thumbnail

On the regular structure of prefix rewritings

Didier Caucal

[Research Report] RR-1196, INRIA. 1990

Rapport (rapport de recherche) inria-00075362v1
Deposit thumbnail

Graphes canoniques de graphes algébriques

Didier Caucal

[Rapport de recherche] RR-0872, INRIA. 1988

Rapport (rapport de recherche) inria-00075682v1
Deposit thumbnail

Récritures suffixes de mots

Didier Caucal

[Rapport de recherche] RR-0871, INRIA. 1988

Rapport (rapport de recherche) inria-00075683v1
Deposit thumbnail

Les graphes à motifs

Didier Caucal

[Rapport de recherche] RR-0958, INRIA. 1988

Rapport (rapport de recherche) inria-00075601v1
Deposit thumbnail

How to improve branching algorithms for deciding on grammars equivalence

Didier Caucal

[Research Report] RR-0618, INRIA. 1987

Rapport (rapport de recherche) inria-00075936v1
Deposit thumbnail

Algorithme optimal de décision pour l'équivalence des grammaires simples

Didier Caucal

[Rapport de recherche] RR-0344, INRIA. 1984

Rapport (rapport de recherche) inria-00076213v1