| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Didier Caucal, Dinh Trong Hieu |
Regularity and Context-Freeness over Word Rewriting Systems.  |
FOSSACS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal, Teodor Knapik |
Higher order indexed monadic systems. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
Synchronization of Regular Automata. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal, Anne Siegel |
Preface. |
ITA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal, Stéphane Hassen |
Synchronization of Grammars. |
CSR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
Deterministic graph grammars. |
Logic and Automata |
2008 |
DBLP BibTeX RDF |
|
| 1 | Didier Caucal |
Boolean algebras of unambiguous context-free languages. |
FSTTCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal, Dinh Trong Hieu |
Path Algorithms on Regular Graphs. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter |
Efficient Computation of Throughput Values of Context-Free Languages. |
CIAA |
2007 |
DBLP DOI BibTeX RDF |
push-down automaton, minimal mean weight, throughput, context-free grammar |
| 1 | Arnaud Carayol, Didier Caucal |
The Kleene Equality for Graphs. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
Synchronization of Pushdown Automata. |
Developments in Language Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
On infinite transition graphs having a decidable monadic theory. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
On the transition graphs of turing machines. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal, Teodor Knapik |
A Chomsky-Like Hierarchy of Infinite Graphs. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
On Infinite Terms Having a Decidable Monadic Theory. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal, Teodor Knapik |
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs. |
Theory Comput. Syst. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
On the Transition Graphs of Turing Machines. |
MCU |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
On Word Rewriting Systems Having a Rational Derivation. |
FoSSaCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Burkart, Didier Caucal, Bernhard Steffen |
Bisimulation Collapse and the Process Taxonomy. |
CONCUR |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
On Infinite Transition Graphs Having a Decidable Monadic Theory. |
ICALP |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal, Dung T. Huynh, Lu Tian |
Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2 |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Burkart, Didier Caucal, Bernhard Steffen |
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. |
MFCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
A Fast Algorithm to Decide on the Equivalence of Stateless DPDA. |
ITA |
1993 |
DBLP BibTeX RDF |
|
| 1 | Didier Caucal |
On the Regular Structure of Prefix Rewriting. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
Monadic Theory of Term Rewritings |
LICS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
Branching Bisimulation for Context-free Processes. |
FSTTCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
Graphes canoniques de graphes algébriques. |
ITA |
1990 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal, Roland Monfort |
On the transition graphs of automata and grammars. |
WG |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
On the Regular Structure of Prefix Rewriting. |
CAAP |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
A Fast Algorithm to Decide on Simple Grammars Equivalence. |
Optimal Algorithms |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal |
Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples. |
STACS |
1986 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")