Sommaire du Fascicule no. 1

Axiomatizing omega and omega-op powers of words
p. 3-17
Weightreducing grammars and ultralinear languages
p. 19-25
Asymptotic behaviour of bi-infinite words
p. 27-48
Free group languages : rational versus recognizable
p. 49-67
On the equivalence of linear conjunctive grammars and trellis automata
p. 69-88

Sommaire du Fascicule no. 2

Finite completion of comma-free codes. Part 1
p. 91-115
Finite completion of comma-free codes. Part 2
p. 117-136
Time and space complexity of reversible pebbling
p. 137-161
Complexity of infinite words associated with beta-expansions
p. 163-185

Sommaire du Fascicule no. 3

Circular splicing and regularity
p. 189-228
Algebraic tools for the construction of colored flows with boundary constraints
p. 229-243
Monoid presentations of groups by finite special string-rewriting systems
p. 245-256
On differentiation functions, structure functions, and related languages of context-free grammars
p. 257-267
Corrigendum : “Complexity of infinite words associated with beta-expansions”
p. 269-271

Sommaire du Fascicule no. 4

Foreword
p. 275-276
Termination checking with types
p. 277-319
Coproducts of ideal monads
p. 321-342
Comparing the succinctness of monadic query languages over finite trees
p. 343-373
An abstract monadic semantics for value recursion
p. 375-400