Math 2.0

Computer science Definition

Combinatorics on words

Builds on MonoidCombinatorics

Definition

Let AA be a finite set, the alphabet, whose elements are letters. A finite word over AA is a finite sequence w=a1a2⋯anw = a_1 a_2 \cdots a_n of letters, also called a string; an infinite word is a sequence (ai)i≥1(a_i)_{i \ge 1}. The finite words form the free monoid A∗A^* under concatenation, with the empty word as identity. A factor of ww is a word uu with w=xuyw = x u y for some words x,yx, y. Combinatorics on words is the branch of combinatorics that studies the structure of words in A∗A^* and of infinite words over AA. Its typical questions concern factors, repetitions, periods and morphisms of A∗A^*.

Remarks

Example: a square is a nonempty word of the form uuu u. Every binary word of length at least 44 contains a square factor. Indeed, a square-free binary word cannot contain aaaa or bbbb, so it alternates, and abababab or babababa is a square.

Example: the Thue–Morse sequence is an infinite binary word with no factor of the form axaxaa x a x a with aa a letter, so it is overlap-free.

Non-example: the word acac is not a factor of abcabc. It is only a subsequence of abcabc, since a factor must consist of consecutive letters.

Results of the field include the Fine–Wilf theorem on words with two periods and the existence of infinite square-free words over three letters.

Reading path

To understand this page from the ground up, read these 7 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Binary operation definition
  2. Combinatorics concept
  3. Associativity definition
  4. Identity element definition
  5. Semigroup definition
  6. Monoid definition
  7. Combinatorics on words definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Combinatorics_on_words
About this page
TagN815PEPPFA
URIm2://N815PEPPFA
Kinddefinition
WritingW0 stub
MSC68R15, 05A05
DefinesCombinatorics on words
UsesMonoid, Combinatorics
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.