Sommaire du Fascicule no. 1

Minimal generators of submonoids of A ∞
On finitely generated monoids of matrices with entries in ℕ
On equality sets of morphisms in topological free monoids
Approximate counting : an alternative approach
Automates et codes zigzag
Lambda-calcul, évaluation paresseuse et mise en mémoire
A limit theorem for “quicksort”

Sommaire du Fascicule no. 2

Spanning trees with low crossing number
First-order properties of trees, star-free expressions, and aperiodicity
A generalization of traces
Preuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm
Subdivisions de surfaces et cartes généralisées de dimension 2

Sommaire du Fascicule no. 3

On a code problem concerning planar acyclic graphs
Solides non organisés : définition, implantation et plongement
The topologies of sofic subshifts have computable Pierce invariants
On a subclass of context-free groups
Introduction aux polyèdres en combinatoire d'après E. Ehrhart et R. Stanley
Reducibilities on tally and sparse sets

Sommaire du Fascicule no. 4

On z-submonoids and z-codes
On the parallel complexity of linear groups
An extension of the notions of traces and of asynchronous automata

Sommaire du Fascicule no. 5

Prolog infinite trees and automata
A note on the paper “disjunctive languages and compatible orders”
Matrix versions of aperiodic K-rational identities
Implementing term rewriting by jungle evaluation
Normal forms for phrase-structure grammars

Sommaire du Fascicule no. 6

Can we transform logic programs into attribute grammars ?
Some modifications of auxiliary pushdown automata
Intuitionistic three-valued logic and logic programming