Abstract
After giving an overview about morphisms and k-power-freeness (k∈ IN ), we present several conjectures, and partially solve one of those by giving, for any integer k≥3, binary morphisms which are not k-power-free, but which are (k+1)-power-free and generate k-power-free infinite words.
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.
