Geodesic

Sommaire du Fascicule no. 1

Fixpoints, games and the difference hierarchy
p. 1-15
On the analysis of Petri nets and their synthesis from process languages
p. 17-38
Lower bounds for Las Vegas automata by information theory
p. 39-49
Complexity theoretical results on nondeterministic graph-driven read-once branching programs
p. 51-66
Wadge degrees of ω-languages of deterministic Turing machines
p. 67-83
Some algorithms to compute the conjugates of episturmian morphisms
p. 85-104

Sommaire du Fascicule no. 2

On the topological complexity of infinitary rational relations
p. 105-113
Undecidability of topological and arithmetical properties of infinitary rational relations
p. 115-126
Smooth and sharp thresholds for random k-XOR-CNF satisfiability
p. 127-147
A bound for the ω-equivalence problem of polynomial D0L systems
p. 149-157
The communication hierarchy of time and space bounded parallel machines
p. 159-176

Sommaire du Fascicule no. 3

Regular languages definable by Lindström quantifiers
p. 179-241
Equational description of pseudovarieties of homomorphisms
p. 243-254
On 𝖿-wise arc forwarding index and wavelength allocations in faulty all-optical hypercubes
p. 255-270

Sommaire du Fascicule no. 4

Preface
p. i
Traced premonoidal categories
p. 273-299
Solving algebraic equations using coalgebra
p. 301-314
Generalizing substitution
p. 315-336
Domain mu-calculus
p. 337-364
On global induction mechanisms in a μ-calculus with explicit approximations
p. 365-391