Abstract
Let g, h : {a, b}* → {a, b}* be marked morphisms of words. A pair (g1, h1) of marked morphisms {a, b}* → {a, b}* is called a successor of (g, h) if g ◦ g1(a) = h ◦ h1(a) and g ◦ g1(b) = h ◦ h1(b) and the images of g1and h1are shortest possible. Successors play an important role in studying the Post Correspondence Problem. Typically, they are simpler than the original morphisms, measured by the number of suffixes of their images (called the suffix complexity). In some cases, however, the suffix complexity is stable – it does not decrease. In this paper we give a full characterization of binary morphisms with stable suffix complexity.
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 callMore From: International Journal of Foundations of Computer Science
Disclaimer: 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.
