Didier Caucal

Publication Activity (10 Years)

Years Active: 1986-2022
Publications (10 Years): 8

Top Topics

Attribute Grammars

Finite Alphabet

Algebraic Structures

Top Venues

Fundam. Informaticae

Models, Mindsets, Meta

Publications

Didier Caucal, Chloé Rispal
Synchronizable functions on integers. CoRR (2022)
Didier Caucal
Cayley graphs of basic algebraic structures. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Didier Caucal
On Cayley graphs of basic algebraic structures. CoRR (2019)
Didier Caucal, Teodor Knapik
Shelah-Stupp's Iteration and Muchnik's Iteration. Fundam. Informaticae 159 (4) (2018)
Didier Caucal, Chloé Rispal
Recognizability for Automata. DLT (2018)
Didier Caucal
On Cayley graphs of algebraic structures. CoRR (2018)
Didier Caucal, Chloé Rispal
Boolean Algebras by Length Recognizability. Models, Mindsets, Meta (2018)
Didier Caucal
Structural characterization of Cayley graphs. CoRR (2016)
Didier Caucal, Marion Le Gonidec
Context-Free Sequences. ICTAC (2014)
Didier Caucal, Dinh Trong Hieu
Regularity and Context-Freeness over Word Rewriting Systems. FoSSaCS (2011)
Didier Caucal, Teodor Knapik
Higher order indexed monadic systems. FSTTCS (2011)
Didier Caucal
Synchronization of Regular Automata. MFCS (2009)
Didier Caucal, Stéphane Hassen
Synchronization of Grammars. CSR (2008)
Didier Caucal
Deterministic graph grammars. Logic and Automata (2008)
Didier Caucal
Boolean algebras of unambiguous context-free languages. FSTTCS (2008)
Didier Caucal, Anne Siegel
Preface. RAIRO Theor. Informatics Appl. 42 (3) (2008)
Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
Efficient Computation of Throughput Values of Context-Free Languages. CIAA (2007)
Didier Caucal, Dinh Trong Hieu
Path Algorithms on Regular Graphs. FCT (2007)
Didier Caucal
Synchronization of Pushdown Automata. Developments in Language Theory (2006)
Arnaud Carayol, Didier Caucal
The Kleene Equality for Graphs. MFCS (2006)
Didier Caucal
On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci. 290 (1) (2003)
Didier Caucal
On the transition graphs of turing machines. Theor. Comput. Sci. 296 (2) (2003)
Didier Caucal, Teodor Knapik
A Chomsky-Like Hierarchy of Infinite Graphs. MFCS (2002)
Didier Caucal
On Infinite Terms Having a Decidable Monadic Theory. MFCS (2002)
Didier Caucal, Teodor Knapik
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs. Theory Comput. Syst. 34 (4) (2001)
Didier Caucal
On the Transition Graphs of Turing Machines. MCU (2001)
Didier Caucal
On Word Rewriting Systems Having a Rational Derivation. FoSSaCS (2000)
Olaf Burkart, Didier Caucal, Bernhard Steffen
Bisimulation Collapse and the Process Taxonomy. CONCUR (1996)
Didier Caucal
On Infinite Transition Graphs Having a Decidable Monadic Theory. ICALP (1996)
Olaf Burkart, Didier Caucal, Bernhard Steffen
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. MFCS (1995)
Didier Caucal, Dung T. Huynh, Lu Tian
Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2 Inf. Comput. 118 (2) (1995)
Didier Caucal
A Fast Algorithm to Decide on the Equivalence of Stateless DPDA. RAIRO Theor. Informatics Appl. 27 (1) (1993)
Didier Caucal
Branching Bisimulation for Context-free Processes. FSTTCS (1992)
Didier Caucal
Monadic Theory of Term Rewritings LICS (1992)
Didier Caucal
On the Regular Structure of Prefix Rewriting. Theor. Comput. Sci. 106 (1) (1992)
Didier Caucal
An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes. Graph-Grammars and Their Application to Computer Science (1990)
Didier Caucal
On the Regular Structure of Prefix Rewriting. CAAP (1990)
Didier Caucal, Roland Monfort
On the transition graphs of automata and grammars. WG (1990)
Didier Caucal
Graphes canoniques de graphes algébriques. RAIRO Theor. Informatics Appl. 24 (1990)
Didier Caucal
A Fast Algorithm to Decide on Simple Grammars Equivalence. Optimal Algorithms (1989)
Didier Caucal
Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples. STACS (1986)