Sommaire du Fascicule no. 1

Foreword
Morphisms fixing words associated with exchange of three intervals
Radix enumeration of rational languages
On the computation of covert channel capacity
How to build billiard words using decimations
Formal language properties of hybrid systems with strong resets
Infinite words containing squares at every position
On the number of squares in partial words
The critical exponent of the Arshon words
Binary words avoiding the pattern AABBCABBA
Standard factors of sturmian words
On the growth rates of complexity of threshold languages

Sommaire du Fascicule no. 2

Unambiguous erasing morphisms in free monoids
Generalizations of Parikh mappings
Extending regular expressions with homomorphic replacement
On the syntactic complexity of tree series

Sommaire du Fascicule no. 3

On the D0L repetition threshold
Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
Balances and abelian complexity of a certain class of infinite ternary words
Corrigendum to our paper : How expressions can code for automata
The uniform minimum-ones 2SAT problem and its application to haplotype classification
Function operators spanning the arithmetical and the polynomial hierarchy

Sommaire du Fascicule no. 4

Quantum coherent spaces and linear logic
Sturmian jungle (or garden?) on multiliteral alphabets
Classes of two-dimensional languages and recognizability conditions
The code problem for directed figures
Translation from classical two-way automata to pebble two-way automata
A CAT algorithm for the exhaustive generation of ice piles