Issue no. 1 Table of Contents

The limiting common distribution of two leaf heights in a random binary tree
Normalization of place/transition-systems preserves net behaviour
Rebootable and suffix-closed ω-power languages
Rétractions et interprétation interne du polymorphisme : le problème de la rétraction universelle
Indexed counter languages

Issue no. 2 Table of Contents

TTL : a formalism to describe local and global properties of distributed systems
Crossability of cancellative Kleene semigroups
On a tree collision resolution algorithm in presence of capture

Issue no. 3 Table of Contents

Repetitions in the Fibonacci infinite word
Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères
Algèbres effectives dans la programmation logique avec contraintes
Compositional representation of rational functions
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
Caractérisation results about L codes

Issue no. 4 Table of Contents

Enumeration of bordered words, le langage de la vache-qui-rit
Mots infinis et produits de matrices a coefficients polynomiaux
Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines
Finitary codes for biinfinite words

Issue no. 5 Table of Contents

Enumerating Davenport-Schinzel sequences
Compositional characterization of observable program properties
The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case
Open shop scheduling with delays
Une extension d'un théorème de P. Jullien sur les âges de mots

Issue no. 6 Table of Contents

Algorithme de multiplicativité des sommes de carrés
Separating ⊕L from L,NL, co-NL, and AL=P for oblivious Turing machines of linear access
On the automorphism group of a toroidal hypermap
Parties reconnaissables de monoïdes définis par générateurs et relations
Sur le produit avec compteur modulo un nombre premier
On coding morphisms for zigzag codes