Volume 37,
Number 1,
January-March 2003
- Julian C. Bradfield:
Fixpoints, games and the difference hierarchy.
1-15
- Ludwik Czaja:
On the Analysis of Petri Nets and their Synthesis from Process Languages.
17-38
- Mika Hirvensalo, Sebastian Seibert:
Lower Bounds for Las Vegas Automata by Information Theory.
39-49
- Beate Bollig:
Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs.
51-66
- Victor L. Selivanov:
Wadge Degrees of [omega]-Languages of Deterministic Turing Machines.
67-83
- Gwénaël Richomme:
Some algorithms to compute the conjugates of Episturmian morphisms.
85-104
Volume 37,
Number 2,
April-June 2003
- Olivier Finkel:
On the Topological Complexity of Infinitary Rational Relations.
105-113
- Olivier Finkel:
Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations.
115-126
- Nadia Creignou, Hervé Daudé:
Smooth and sharp thresholds for random k-XOR-CNF satisfiability.
127-147
- Juha Honkala:
A bound for the [omega]-equivalence problem of polynomial D0L systems.
149-157
- Norbert Popély:
The Communication Hierarchy of Time and Space Bounded Parallel Machines.
159-176
Volume 37,
Number 3,
July-September 2003
Volume 37,
Number 4,
October-December 2003
Special Issue:
Fixed Points in Computer Science (FICS'02)
Copyright © Tue Dec 1 16:33:26 2009
by Michael Ley (ley@uni-trier.de)
