On the Decidability of Some Problems Concerning Morphisms, Regular Sets, and Post Correspondence Problem
Paavo Turakainen · Fundamenta Informaticae · 1999
Regular languages are divided into equivalence classes according to the lengths of the words and both the universal and the existential equivalence of rational transductions on the set of these classes is studied. It is shown that the cardinality equ