Jean-Claude Raoult

According to our database1, Jean-Claude Raoult authored at least 14 papers between 1977 and 1999.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1999
Context-Free Event Domains are Recognizable.
Inf. Comput., 1999

1993
Recursively Defined Tree Transductions.
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

Set-Theoretic Graph Rewriting.
Proceedings of the Graph Transformations in Computer Science, International Workshop, 1993

1992
A survey of tree transductions.
Proceedings of the Tree Automata and Languages., 1992

1988
Proving Open Properties by Induction.
Inf. Process. Lett., 1988

1984
On Graph Rewritings.
Theor. Comput. Sci., 1984

The Global Storage Needs of a Subcomputation.
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

1983
Properties of a Notation for Combining Functions
J. ACM, July, 1983

1981
Finiteness Results on Rewriting Systems.
RAIRO Theor. Informatics Appl., 1981

1980
Operational and Semantic Equivalence Between Recursive Programs.
J. ACM, 1980

Completions of ordered magmas.
Fundam. Informaticae, 1980

Optimal Unbounded Search Strategies.
Proceedings of the Automata, 1980

1979
The Number of Registers Required for Evaluating Arithmetic Expressions.
Theor. Comput. Sci., 1979

1977
On the Average Number of Registers Required for Evaluating Arithmetic Expressions
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977


  Loading...