The Equivalence Problem of D0L and DF0L Power Series
Juha Honkala · Fundamenta Informaticae · 1999
We show that it is decidable whether or not a given D0L power series and a given DF0L power series over a computable field are equal. This generalizes to power series the result of Ruohonen stating that DF0L-D0L language equivalence is decidable.