Simple reductions between \(D0L\) language and sequence equivalence problems
It is known that both LE-D0L and SE-DOL problems are decidable and that any algorithm for solving one of them can be transformed into an algorithm for solving the other one. The author presents transformations essentially simpler than those existing in the references. The proof of total correctness of the algorithms is outlined. As the author remarks, the ideas might be useful also in other considerations dealing with morphisms on free monoids.
scientific article; zbMATH DE number 166482