= Combinatorics on words
<Combinatorics on words> studies finite and infinite <sequences> of symbols from an <alphabet>, especially repetition, ordering and occurrence of shorter words. A finite <word> is an element of the <free monoid> generated by its <alphabet>, with <concatenation> as its operation. For example, `abab` has two occurrences of `ab` and is the square of `ab`; `aba` is a <palindrome>. These questions connect <algorithms> on <words> with <generating functions> and symbolic descriptions of <dynamical systems>.
Back to article page
