| 2008 |
|---|
| 27 | EE | Didier Caucal,
Stéphane Hassen:
Synchronization of Grammars.
CSR 2008: 110-121 |
| 26 | EE | Didier Caucal:
Boolean algebras of unambiguous context-free languages.
FSTTCS 2008 |
| 2007 |
|---|
| 25 | EE | Didier Caucal,
Jurek Czyzowicz,
Wojciech Fraczak,
Wojciech Rytter:
Efficient Computation of Throughput Values of Context-Free Languages.
CIAA 2007: 203-213 |
| 24 | EE | Didier Caucal,
Dinh Trong Hieu:
Path Algorithms on Regular Graphs.
FCT 2007: 199-212 |
| 2006 |
|---|
| 23 | EE | Didier Caucal:
Synchronization of Pushdown Automata.
Developments in Language Theory 2006: 120-132 |
| 22 | EE | Arnaud Carayol,
Didier Caucal:
The Kleene Equality for Graphs.
MFCS 2006: 214-225 |
| 2003 |
|---|
| 21 | | Didier Caucal:
On infinite transition graphs having a decidable monadic theory.
Theor. Comput. Sci. 290(1): 79-115 (2003) |
| 20 | EE | Didier Caucal:
On the transition graphs of turing machines.
Theor. Comput. Sci. 296(2): 195-223 (2003) |
| 2002 |
|---|
| 19 | EE | Didier Caucal:
On Infinite Terms Having a Decidable Monadic Theory.
MFCS 2002: 165-176 |
| 18 | EE | Didier Caucal,
Teodor Knapik:
A Chomsky-Like Hierarchy of Infinite Graphs.
MFCS 2002: 177-187 |
| 2001 |
|---|
| 17 | EE | Didier Caucal:
On the Transition Graphs of Turing Machines.
MCU 2001: 177-189 |
| 16 | EE | Didier Caucal,
Teodor Knapik:
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs.
Theory Comput. Syst. 34(4): 299-336 (2001) |
| 2000 |
|---|
| 15 | EE | Didier Caucal:
On Word Rewriting Systems Having a Rational Derivation.
FoSSaCS 2000: 48-62 |
| 1996 |
|---|
| 14 | | Olaf Burkart,
Didier Caucal,
Bernhard Steffen:
Bisimulation Collapse and the Process Taxonomy.
CONCUR 1996: 247-262 |
| 13 | | Didier Caucal:
On Infinite Transition Graphs Having a Decidable Monadic Theory.
ICALP 1996: 194-205 |
| 1995 |
|---|
| 12 | | Olaf Burkart,
Didier Caucal,
Bernhard Steffen:
An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes.
MFCS 1995: 423-433 |
| 11 | | Didier Caucal,
Dung T. Huynh,
Lu Tian:
Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2
Inf. Comput. 118(2): 306-315 (1995) |
| 1993 |
|---|
| 10 | | Didier Caucal:
A Fast Algorithm to Decide on the Equivalence of Stateless DPDA.
ITA 27(1): 23-48 (1993) |
| 1992 |
|---|
| 9 | | Didier Caucal:
Branching Bisimulation for Context-free Processes.
FSTTCS 1992: 316-327 |
| 8 | | Didier Caucal:
Monadic Theory of Term Rewritings
LICS 1992: 266-273 |
| 7 | | Didier Caucal:
On the Regular Structure of Prefix Rewriting.
Theor. Comput. Sci. 106(1): 61-86 (1992) |
| 1990 |
|---|
| 6 | | Didier Caucal:
On the Regular Structure of Prefix Rewriting.
CAAP 1990: 87-102 |
| 5 | | 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: 190-206 |
| 4 | | Didier Caucal,
Roland Monfort:
On the transition graphs of automata and grammars.
WG 1990: 311-337 |
| 3 | | Didier Caucal:
Graphes canoniques de graphes algébriques.
ITA 24: 339-352 (1990) |
| 1989 |
|---|
| 2 | | Didier Caucal:
A Fast Algorithm to Decide on Simple Grammars Equivalence.
Optimal Algorithms 1989: 66-85 |
| 1986 |
|---|
| 1 | | Didier Caucal:
Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples.
STACS 1986: 37-48 |
