Didier Caucal

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