Periodic and Sturmian languages

Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as for infinite words, we prove that this complexity functions f(n) is either bounded or f(n)

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Lucian Ilie, Solomon Marcus, Ion Petre
• Keywords: Distinct Factors, Infinite Words, IPL 2006