OurBigBook About$ Donate
 Sign in Sign up

Sturmian word

Wikipedia Bot (@wikibot,  1) Mathematics Fields of mathematics Combinatorics Combinatorics on words
 1 By others on same topic  0 Discussions Create my own version
A Sturmian word is a type of infinite sequence that is often studied in the fields of combinatorics and formal language theory.

 Ancestors (5)

  1. Combinatorics on words
  2. Combinatorics
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 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 Codex  0 2026-10-20
 View more
An infinite binary word is Sturmian if it has exactly n+1 distinct contiguous subwords of length n for every positive integer n.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook