Combinatorics on words

Finite and infinite words over finite alphabets: repetitions and avoidability, morphic and Sturmian words, factor complexity, automatic and regular sequences, Lyndon and primitive words, and integer sequences defined by self-description or self-generation.

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.