Didier Caucal

According to our database, Didier Caucal authored at least 38 papers between 1986 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Synchronizable functions on integers.

Didier Caucal, Chloé Rispal

CoRR, 2022

2019

Cayley graphs of basic algebraic structures.

Didier Caucal

Discret. Math. Theor. Comput. Sci., 2019

2018

Shelah-Stupp's Iteration and Muchnik's Iteration.

Didier Caucal, Teodor Knapik

Fundam. Informaticae, 2018

On Cayley graphs of algebraic structures.

Didier Caucal

CoRR, 2018

Recognizability for Automata.

Didier Caucal, Chloé Rispal

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Boolean Algebras by Length Recognizability.

Didier Caucal, Chloé Rispal

Proceedings of the Models, Mindsets, 2018

2016

Structural characterization of Cayley graphs.

Didier Caucal

CoRR, 2016

2014

Context-Free Sequences.

Didier Caucal, Marion Le Gonidec

Proceedings of the Theoretical Aspects of Computing - ICTAC 2014, 2014

2011

Higher order indexed monadic systems.

Didier Caucal, Teodor Knapik

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Regularity and Context-Freeness over Word Rewriting Systems.

Didier Caucal, Dinh Trong Hieu

Proceedings of the Foundations of Software Science and Computational Structures, 2011

2009

Synchronization of Regular Automata.

Didier Caucal

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

Preface.

Didier Caucal, Anne Siegel

RAIRO Theor. Informatics Appl., 2008

Boolean algebras of unambiguous context-free languages.

Didier Caucal

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Synchronization of Grammars.

Didier Caucal, Stéphane Hassen

Proceedings of the Computer Science, 2008

Deterministic graph grammars.

Didier Caucal

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

Efficient Computation of Throughput Values of Context-Free Languages.

Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter

Proceedings of the Implementation and Application of Automata, 2007

Path Algorithms on Regular Graphs.

Didier Caucal, Dinh Trong Hieu

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006

The Kleene Equality for Graphs.

Arnaud Carayol, Didier Caucal

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Synchronization of Pushdown Automata.

Didier Caucal

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2003

On the transition graphs of turing machines.

Didier Caucal

Theor. Comput. Sci., 2003

On infinite transition graphs having a decidable monadic theory.

Didier Caucal

Theor. Comput. Sci., 2003

2002

A Chomsky-Like Hierarchy of Infinite Graphs.

Didier Caucal, Teodor Knapik

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

On Infinite Terms Having a Decidable Monadic Theory.

Didier Caucal

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs.

Didier Caucal, Teodor Knapik

Theory Comput. Syst., 2001

Verification on Infinite Structures.

Olaf Burkart, Didier Caucal, Faron Moller, Bernhard Steffen

Proceedings of the Handbook of Process Algebra, 2001

2000

On Word Rewriting Systems Having a Rational Derivation.

Didier Caucal

Proceedings of the Foundations of Software Science and Computation Structures, 2000

1996

Bisimulation Collapse and the Process Taxonomy.

Olaf Burkart, Didier Caucal, Bernhard Steffen

Proceedings of the CONCUR '96, 1996

1995

Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2

Didier Caucal, Dung T. Huynh, Lu Tian

Inf. Comput., May, 1995

An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes.

Olaf Burkart, Didier Caucal, Bernhard Steffen

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1993

A Fast Algorithm to Decide on the Equivalence of Stateless DPDA.

Didier Caucal

RAIRO Theor. Informatics Appl., 1993

1992

On the Regular Structure of Prefix Rewriting.

Didier Caucal

Theor. Comput. Sci., 1992

Monadic Theory of Term Rewritings

Didier Caucal

Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

Branching Bisimulation for Context-free Processes.

Didier Caucal

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1990

Graphes canoniques de graphes algébriques.

Didier Caucal

RAIRO Theor. Informatics Appl., 1990

On the transition graphs of automata and grammars.

Didier Caucal, Roland Monfort

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes.

Didier Caucal

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

1989

A Fast Algorithm to Decide on Simple Grammars Equivalence.

Didier Caucal

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

1986

Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples.

Didier Caucal

Proceedings of the STACS 86, 1986