Abstract
In no 32 of the EATCS Bulletin, Márton Kósa stated five conjectures concerning the study of some binary morphisms and the factors of the infinite words these morphisms generate [11].I prove the first four conjectures, the main result being the characterization of a large class of morphisms which stationary words are Sturmian.KeywordsSymbolic DynamicFibonacci NumberStationary WordFibonacci SequenceLetter AlphabetThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
