RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 1

Sommaire

Minimal generators of submonoids of

A^{\infty}

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

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”

p. 85-100