The Equivalence Problem of D0L and DF0L Power Series

Article type: Research Article

Authors: Honkala, Juha^;

Affiliations: Department of Mathematics University of Turku FIN-20014 Turku, Finland juha.honkala@utu.fi | Turku Centre for Computer Science (TUCS), FIN-20520 Turku, Finland

Note: [] Address for correspondence: Department of Mathematics, University of Turku, FIN 20014 Turku, Finland

Abstract: 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.

Keywords: DOL system, formal power series, decidability

DOI: 10.3233/FI-1999-381216

Journal: Fundamenta Informaticae, vol. 38, no. 1-2, pp. 201-208, 1999