Abstract
The paper is focused on some problems related to existence of periodic structures in words from formal languages. Squares, i.e., fragments of the form xx, where x is some word, and squares with one error, i.e. fragments of the form xy, where the word x is different from the word y in only one letter, are considered. We study the existence of arbitrarily long words not containing squares with the length exceeding l0 and squares with one error and the length more than l1 depending on the natural numbers l0, l1 For all possible pairs l1 > l0 we find the minimal alphabet such that there exists an arbitrarily long word with these properties over this alphabet.
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.
