High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! In mathematics, a Sturmian word is a certain kind of infinite word. A word is a (potentially) infinite sequence of symbols drawn from a finite alphabet. Call any finite contiguous subsequence of a word a factor. Then, a word w is Sturmian if, for all natural numbers n, w has exactly n + 1 distinct factors of length n. Note that there must then be two distinct factors of length 1, implying that word uses exactly 2 symbols from the alphabet (without loss of generality we can call these 0 and 1).

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.