Abstract
We establish as our main results the following two theorems on compositions of morphisms and inverse morphisms. It is undecidable whether or not two transductions of the form h2h 2 −1 , where h1 and h2 are morphisms, are equivalent (word by word) on a given regular language, while the same problem for transductions of the form h 1 −1 h2 is decidable. Consequently, a sharp borderline between decidable and undecidable problems is found.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
