Sommaire du Fascicule no. 1

Fixpoints, games and the difference hierarchy
On the analysis of Petri nets and their synthesis from process languages
Lower bounds for Las Vegas automata by information theory
Complexity theoretical results on nondeterministic graph-driven read-once branching programs
Wadge degrees of ω-languages of deterministic Turing machines
Some algorithms to compute the conjugates of episturmian morphisms

Sommaire du Fascicule no. 2

On the topological complexity of infinitary rational relations
Undecidability of topological and arithmetical properties of infinitary rational relations
Smooth and sharp thresholds for random k-XOR-CNF satisfiability
A bound for the ω-equivalence problem of polynomial D0L systems
The communication hierarchy of time and space bounded parallel machines

Sommaire du Fascicule no. 3

Regular languages definable by Lindström quantifiers
Equational description of pseudovarieties of homomorphisms
On 𝖿-wise arc forwarding index and wavelength allocations in faulty all-optical hypercubes

Sommaire du Fascicule no. 4

Preface
Traced premonoidal categories
Solving algebraic equations using coalgebra
Generalizing substitution
Domain mu-calculus
On global induction mechanisms in a μ-calculus with explicit approximations