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).
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!