Volume 33, Number 1, January/February 1999
: Strongly locally testable semigroups with commuting idempotents and related languages.
: On-line finite automata for addition in some numeration systems.
Volume 33, Number 2, March/April 1999
, Tero Harju
: Undecidability of the equivalence of finite substitutions on regular language.
: On sequences defined by D0L power series.
: Immunity and simplicity for exact counting and other counting classes.
: On the median-of-K version of Hoare's selection algorithm.
: Communication complexity and lower bounds on multilective computations.
Volume 33, Number 3, May/June 1999
, Patrice Duroux
: Normalisation of the Theory T of Cartesian Closed Categories and Conservativity of Extensions T[x] of T.
Volume 33, Number 4/5, July/October 1999
: Monotone (co)inductive types and positive fixed-point types.
: p329 The µ-calculus alternation-depth hierarchy is strict on binary trees.
Julian C. Bradfield
: Fixpoint alternation: Arithmetic, transition systems, and the binary tree.
Volume 33, Number 6, November/December 1999