Home
 
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
  • All
  • Author
  • Title
  • References
  • Full text
NOT
Between and
  • All
  • Author
  • Title
  • Date
  • References
  • Mots-clés
  • Full text
  • RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
  • Volume 18 (1984)
  • no. 1

Table of contents


Data types as algorithms
Nait Abdallah, M. A.
p. 3-22

Hiérarchies de concaténation
Pin, Jean-Eric
p. 23-46

On expressing commutativity by finite Church-Rosser presentations : a note on commutative monoids
Avenhaus, Jürgen;  Book, Ronald V.;  Squier, Craig C.
p. 47-52

Systolic tree acceptors
Culik, Karel Ii;  Salomaa, Arto;  Wood, Derick
p. 53-69

A fast method of deadlock avoidance
Bak, Piotr
p. 71-80
  • About
  • Help
  • Legal notice
  • Contact
 

Published by

 

Supported by

 
 

Partner of