Didier Caucal

Proceedings of the Machines, Computations, and Universality, 2024

2022

Synchronizable functions on integers.

[BibT_eX]

[DOI]

CoRR, 2022

2019

Cayley graphs of basic algebraic structures.

[BibT_eX]

[DOI]

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

2018

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

On Cayley graphs of algebraic structures.

[BibT_eX]

[DOI]

CoRR, 2018

Recognizability for Automata.

[BibT_eX]

[DOI]

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

Boolean Algebras by Length Recognizability.

[BibT_eX]

[DOI]

Proceedings of the Models, Mindsets, 2018

2016

Structural characterization of Cayley graphs.

[BibT_eX]

[DOI]

CoRR, 2016

2014

Context-Free Sequences.

[BibT_eX]

[DOI]

Marion Le Gonidec

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

2011

Higher order indexed monadic systems.

[BibT_eX]

[DOI]

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

Regularity and Context-Freeness over Word Rewriting Systems.

[BibT_eX]

[DOI]

Dinh Trong Hieu

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

2009

Synchronization of Regular Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

Preface.

[BibT_eX]

[DOI]

Anne Siegel

RAIRO Theor. Informatics Appl., 2008

Boolean algebras of unambiguous context-free languages.

[BibT_eX]

[DOI]

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

Synchronization of Grammars.

[BibT_eX]

[DOI]

Stéphane Hassen

Proceedings of the Computer Science, 2008

Deterministic graph grammars.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2007

Path Algorithms on Regular Graphs.

[BibT_eX]

[DOI]

Dinh Trong Hieu

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

2006

The Kleene Equality for Graphs.

[BibT_eX]

[DOI]

Arnaud Carayol

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Synchronization of Pushdown Automata.

[BibT_eX]

[DOI]

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

2002

A Chomsky-Like Hierarchy of Infinite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

On Infinite Terms Having a Decidable Monadic Theory.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 2001

On the Transition Graphs of Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Machines, 2001

Verification on Infinite Structures.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Process Algebra, 2001

2000

On Word Rewriting Systems Having a Rational Derivation.

[BibT_eX]

[DOI]

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

1996

On Infinite Transition Graphs Having a Decidable Monadic Theory.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

Bisimulation Collapse and the Process Taxonomy.

[BibT_eX]

[DOI]

Olaf Burkart

Bernhard Steffen

Proceedings of the CONCUR '96, 1996

1995

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

[BibT_eX]

[DOI]

Dung T. Huynh

Lu Tian

Inf. Comput., May, 1995

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

[BibT_eX]

[DOI]

Olaf Burkart

Bernhard Steffen

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1993

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

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1993

1992

Monadic Theory of Term Rewritings

[BibT_eX]

[DOI]

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

Branching Bisimulation for Context-free Processes.

[BibT_eX]

[DOI]

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

1990

Graphes canoniques de graphes algébriques.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1990

On the transition graphs of automata and grammars.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

On the Regular Structure of Prefix Rewriting.

[BibT_eX]

[DOI]

Proceedings of the CAAP '90, 1990

1989

A Fast Algorithm to Decide on Simple Grammars Equivalence.

[BibT_eX]

[DOI]

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

1986

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

[BibT_eX]

[DOI]