Sciweavers

IPL
2006

Periodic and Sturmian languages

14 years 18 days ago
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)
Lucian Ilie, Solomon Marcus, Ion Petre
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where IPL
Authors Lucian Ilie, Solomon Marcus, Ion Petre
Comments (0)