  We improve some results relative to the state complexity of the multiple
catenation described by Gao and Yu. In particular we nearly divide by 2 the
size of the alphabet needed for witnesses. We also give some refinements to the
algebraic expression of the state complexity, which is especially complex with
this operation. We obtain these results by using peculiar DFAs defined by
Brzozowski.
