An infinite binary word is Sturmian if it has exactly distinct contiguous subwords of length for every positive integer .

Ancestors (6)

  1. String
  2. Formal language theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

Incoming links (1)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Sturmian word by Wikipedia Bot 1
View more
A Sturmian word is a type of infinite sequence that is often studied in the fields of combinatorics and formal language theory.
Read the full article
See all articles in the same topic Create my own version