| 1999 |
|---|
| 20 | | Eric Badouel,
Philippe Darondeau,
Jean-Claude Raoult:
Context-Free Event Domains are Recognizable.
Inf. Comput. 149(2): 134-172 (1999) |
| 1995 |
|---|
| 19 | | Eric Badouel,
Philippe Darondeau,
Jean-Claude Raoult:
Context-Free Event Domains are Recognizable.
AMAST 1995: 214-229 |
| 1993 |
|---|
| 18 | | Jean-Claude Raoult,
Frédéric Voisin:
Set-Theoretic Graph Rewriting.
Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 312-325 |
| 17 | | Jean-Claude Raoult:
Recursively Defined Tree Transductions.
RTA 1993: 343-357 |
| 1992 |
|---|
| 16 | | Jean-Claude Raoult:
CAAP '92, 17th Colloquium on Trees in Algebra and Programming, Rennes, France, February 26-28, 1992, Proceedings
Springer 1992 |
| 15 | | Jean-Claude Raoult:
A survey of tree transductions.
Tree Automata and Languages 1992: 311-326 |
| 1988 |
|---|
| 14 | | Jean-Claude Raoult:
Proving Open Properties by Induction.
Inf. Process. Lett. 29(1): 19-23 (1988) |
| 1984 |
|---|
| 13 | | Jean-Claude Raoult:
On Graph Rewritings.
CAAP 1984: 243-256 |
| 12 | | Jean-Claude Raoult,
Ravi Sethi:
The Global Storage Needs of a Subcomputation.
POPL 1984: 148-157 |
| 11 | | Jean-Claude Raoult:
On Graph Rewritings.
Theor. Comput. Sci. 32: 1-24 (1984) |
| 1983 |
|---|
| 10 | | Jean-Claude Raoult:
On graph rewritings.
Bulletin of the EATCS 21: 39-48 (1983) |
| 9 | EE | Jean-Claude Raoult,
Ravi Sethi:
Properties of a Notation for Combining Functions
J. ACM 30(3): 595-611 (1983) |
| 1982 |
|---|
| 8 | | Jean-Claude Raoult,
Ravi Sethi:
Properties of a Notation for Combining Functions.
ICALP 1982: 429-441 |
| 1981 |
|---|
| 7 | | Jean-Claude Raoult:
Finiteness Results on Rewriting Systems.
ITA 15(4): 373-391 (1981) |
| 1980 |
|---|
| 6 | | Jean-Claude Raoult,
Jean Vuillemin:
Optimal Unbounded Search Strategies.
ICALP 1980: 512-530 |
| 5 | | Bruno Courcelle,
Jean-Claude Raoult:
Completions of ordered magmas.
Fundam. Inform. 3(1): 105- (1980) |
| 4 | EE | Jean-Claude Raoult,
Jean Vuillemin:
Operational and Semantic Equivalence Between Recursive Programs.
J. ACM 27(4): 772-796 (1980) |
| 1979 |
|---|
| 3 | | Philippe Flajolet,
Jean-Claude Raoult,
Jean Vuillemin:
The Number of Registers Required for Evaluating Arithmetic Expressions.
Theor. Comput. Sci. 9: 99-125 (1979) |
| 1978 |
|---|
| 2 | | Jean-Claude Raoult,
Jean Vuillemin:
Operational and Semantic Equivalence between Recursive Programs
STOC 1978: 75-85 |
| 1977 |
|---|
| 1 | | Philippe Flajolet,
Jean-Claude Raoult,
Jean Vuillemin:
On the Average Number of Registers Required for Evaluating Arithmetic Expressions
FOCS 1977: 196-205 |
