Sommaire du Fascicule no. 1

A note on a conjecture of Duval and sturmian words
Polypodic codes
Relating automata-theoretic hierarchies to complexity-theoretic hierarchies
Pipelined decomposable BSP computers
On the distribution of characteristic parameters of words
On the distribution of characteristic parameters of words II

Sommaire du Fascicule no. 2

Preface
A fully equational proof of Parikh's theorem
Semantics of value recursion for monadic input/output
Feedback, trace and fixed-point semantics
μ-bicomplete categories and parity games

Sommaire du Fascicule no. 3

Characterizing the complexity of boolean functions represented by well-structured graph-driven parity-FBDDs
Words over an ordered alphabet and suffix permutations
Permissive strategies : from parity games to safety games
On the size of one-way quantum finite automata with periodic behaviors
On multiplicatively dependent linear numeration systems, and periodic points
Density of critical factorizations

Sommaire du Fascicule no. 4

An upper bound on the space complexity of random formulae in resolution
About the decision of reachability for register machines
On shuffle ideals
On a characteristic property of Arnoux-Rauzy sequences
Integer partitions, tilings of 2D-gons and lattices