Volume 37 (2003) no. 1

Table of contents

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