RAIRO - Theoretical Informatics and Applications

Free Access

Minimal generators of submonoids of $A^\infty $ p. 3

I. Litovsky

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1991250100031

• Abstract
• PDF (1.08 MB)
• References

Free Access

On finitely generated monoids of matrices with entries in $\mathbb {N}$ p. 19

Andreas Weber and Helmut Seidl

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1991250100191

• Abstract
• PDF (1.34 MB)
• References

Free Access

On equality sets of morphisms in topological free monoids p. 39

Wit Foryś

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1991250100391

• Abstract
• PDF (381 KB)
• References

Free Access

Approximate counting : an alternative approach p. 43

Peter Kirschenhofer and Helmut Prodinger

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1991250100431

• Abstract
• PDF (337 KB)
• References

Free Access

Automates et codes zigzag p. 49

Marcella Anselmo

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1991250100491

• Abstract
• PDF (1.23 MB)
• References

Free Access

Lambda-calcul, évaluation paresseuse et mise en mémoire p. 67

Jean-Louis Krivine

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1991250100671

• Abstract
• PDF (1.45 MB)
• References

Free Access

A limit theorem for “quicksort” p. 85

Uwe Rösler

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1991250100851

• Abstract
• PDF (1.12 MB)
• References