Category:Combinatorics on words

• Combinatorics on words

A

• Algorithmic Combinatorics on Partial Words
• Alphabet (formal languages)
• Alternation (formal language theory)
• Autocorrelation (words)
• Automatic group
• Automatic sequence

B

• Beatty sequence

C

• Cobham's theorem
• Compact semigroup
• Critical exponent of a word
• Cyclically reduced word

D

• Davenport–Schinzel sequence
• Davenport–Schinzel Sequences and Their Geometric Applications
• Dehn function
• Dejean's theorem

F

• Formal language
• Free half group
• Free lattice
• Free monoid
• Free object

G

• Graham–Rothschild theorem
• Grammar systems theory

H

• Hall word
• HNN extension
• Hobby–Rice theorem
• Hyperbolic group

I

• Involutive monoid

K

• K-regular sequence
• Knuth–Bendix completion algorithm

L

• Lattice word
• Levi's lemma
• Local language (formal language)
• Locally catenative sequence
• Lyndon word

M

• Morphic word

N

• Necklace (combinatorics)
• Necklace polynomial
• Necklace problem
• Necklace splitting problem
• Nielsen transformation

P

• Parameter word
• Partial word
• Ping-pong lemma
• Plactic monoid
• Presentation of a group

R

• Random group
• Recurrent word

S

• Sesquipower
• Shift space
• Small cancellation theory
• Specht's theorem
• Splicing rule
• Square-free word
• String (computer science)
• Sturmian word
• Subshift of finite type
• Superpermutation
• Symbolic dynamics

T

• Thue number
• Train track map

U

• Unavoidable pattern

V

• Van Kampen diagram

W

• Witt vector
• Word (group theory)
• Word equation
• Word metric
• Word problem (mathematics)
• Word problem for groups
• Word problem for semigroups

Y

• Young–Fibonacci lattice