Issue no. 1 Table of Contents

Systèmes de déduction pour les arbres et les schémas de programme (II)
On subdirectly irreducible automata
Sur l'auto-stabilisation dans un réseau d'ordinateurs
A theory of complexity of monadic recursion schemes

Issue no. 2 Table of Contents

Sémantique des processus communicants
Transductions rationnelles décroissantes
Relational morphisms and operations on recognizable sets
FPOL systems generating counting languages

Issue no. 3 Table of Contents

Arbitrary weight changes in dynamic trees
Transducteurs finis d'arbres et tests d'égalité
Closure properties of certain families of formal languages with respect to a generalization of cyclic closure
The theory of invertible algorithms

Issue no. 4 Table of Contents

On the structure of general stochastic automata
Une formalisation des systèmes conversationnels
Synchronized EOL forms under uniform interpretation
An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation
Finiteness results on rewriting systems