Volume 35 (2001) no. 5

Table of contents

On graph products of automatic monoids
p. 403-417
Commutative images of rational languages and the abelian kernel of a monoid
p. 419-435
A test-set for k-power-free binary morphisms
p. 437-452
Linear size test sets for certain commutative languages
p. 453-475
Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata
p. 477-490