Volume 270, Number 1-2, January 2002
: Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures.
: Searching games with errors - fifty years of coping with liars.
: Calculs sur les structures de langage dénombrable.
: Time-minimal paths amidst moving obstacles in three dimensions.
, Richard Mayr
: Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time.
: The Variance of the height of binary search trees.
: Two undecidability results for chain code picture languages.