Sommaire du Fascicule no. 1

Axiomatizing omega and omega-op powers of words
Weightreducing grammars and ultralinear languages
Asymptotic behaviour of bi-infinite words
Free group languages : rational versus recognizable
On the equivalence of linear conjunctive grammars and trellis automata

Sommaire du Fascicule no. 2

Finite completion of comma-free codes. Part 1
Finite completion of comma-free codes. Part 2
Time and space complexity of reversible pebbling
Complexity of infinite words associated with beta-expansions

Sommaire du Fascicule no. 3

Circular splicing and regularity
Algebraic tools for the construction of colored flows with boundary constraints
Monoid presentations of groups by finite special string-rewriting systems
On differentiation functions, structure functions, and related languages of context-free grammars
Corrigendum : “Complexity of infinite words associated with beta-expansions”

Sommaire du Fascicule no. 4

Foreword
Termination checking with types
Coproducts of ideal monads
Comparing the succinctness of monadic query languages over finite trees
An abstract monadic semantics for value recursion