ω-Computations on deterministic pushdown machines
A trivial algorithm whose analysis isn't
A 222pn upper bound on the complexity of Presburger Arithmetic
Algorithms for updating minimal spanning trees
ET0L forms
On the algebraic structure of rooted trees
Inductive definability in formal language theory
A lower bound of 12n2 on linear search programs for the Knapsack problem
On polynomial time isomorphisms of some new complete sets
On inverse deterministic pushdown transductions
A note on pattern reproduction in tessellation structures
Nondeterminism and boolean operations in pda's
Author index for volume 16