Abstract
We give a complete characterization for all those morphisms on a two-letter alphabet that are repetitive. Based on this characterization we describe those morphisms on a two-letter alphabet that generate an ultimately periodic infinite word, and those morphisms f for which the languages L(f) or SL(f) are context-free or even regular.
Sign-in/Register to access full text options 
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.
