×

About \(k\) to \(k\) insertion words of Sturmian words. (English) Zbl 1252.68219

Summary: In an infinite word \(u\) we insert a foreign letter steadly with step of length \(k\). The word obtained is called \(k\) to \(k\) insertion word of \(u\). In this paper, we are interested in studying some combinatorial properties of \(k\) to \(k\) insertion words of Sturmian words: recurrence, erasure of letter and balance property. We have also given palindrome complexity of these words.

MSC:

68R15 Combinatorics on words
PDFBibTeX XMLCite
Full Text: Link