Summary: We give a new solution for the language equivalence problem of D0L systems with finite axiom sets by using the decidability of the equivalence problem of finite valued transducers on HDT0L languages proved by K. II Culik and J. Karhumäki [Theor. Comput. Sci. 47, 71-84 (1986; Zbl 0621.68049)].