On the Decidability of Some Problems Concerning Morphisms, Regular Sets, and Post Correspondence Problem

Authors:
Paavo Turakainen
Affiliations:
(Correspd.) Department of Mathematical Sciences, University of Oulu, PO Box 3000 OULU, 90401 Finland Paavo. Turakainen@oulu.fi
Venue:
Fundamenta Informaticae
Year:
1999

Citing 11
Cited 0

On the equivalence of some transductions involving letter to letter morphisms on regular languages

Acta Informatica
Formal languages

Formal languages
Cornerstones of undecidability

Cornerstones of undecidability
The undecidability of some equivalence problems concerning ngsm's and finite substitutions

Theoretical Computer Science
Combinatorics of words

Handbook of formal languages, vol. 1
On the system of word equations x0ui1x1ui 2x2&ldots;uimxm =y0vi1y1vi 2y2&ldots;vinyn i=0,1,2,&ldots; in a free monoid

Journal of Automata, Languages and Combinatorics
The Equivalence of DGSM Replications on Q-Rational Languages is Decidable

ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Morphisms

Morphisms
Finite Substitutions and Integer Weighted Finite Automata

Finite Substitutions and Integer Weighted Finite Automata
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages
A Remark on Code Sets and Context-Free Languages

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 equivalence problem is undecidable for ε-free finite substitutions. The morphic replication equivalence problem is arithmetized and an application to word equations is presented. Finally, the generalized Post correspondence problem is modified by using a single inverse morphism or a single finite substitution or its inverse instead of two morphisms.