Home
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
  • Journals
  • Seminars
  • Conferences
  • Books
  • Lecture notes
  • Theses
  • Authors
Browse issues
  • All
  • Author
  • Title
  • References
  • Full text
Between and
  • All
  • Author
  • Title
  • Date
  • References
  • Keywords
  • Full text
  • RAIRO. Theoretical Informatics and Applications
  • Volume 25 (1991)
  • no. 1

Volume 25 (1991) no. 1

Table of contents


Minimal generators of submonoids of A ∞
Litovsky, I.
p. 3-17

On finitely generated monoids of matrices with entries in ℕ
Weber, Andreas; Seidl, Helmut
p. 19-38

On equality sets of morphisms in topological free monoids
Foryś, Wit
p. 39-42

Approximate counting : an alternative approach
Kirschenhofer, Peter;   Prodinger, Helmut  
p. 43-48

Automates et codes zigzag
Anselmo, Marcella
p. 49-66

Lambda-calcul, évaluation paresseuse et mise en mémoire
Krivine, Jean-Louis  
p. 67-84

A limit theorem for “quicksort”
Rösler, Uwe
p. 85-100
  • Accessibility: not compliant
  • About
  • Help
  • Legal notice
  • Contact

Published by

Supported by

 

Partner of