cjerdonek / Critical Factorization Theorem c73de544a2e9209820f6ecfb6ca7b24d411997bf

Create Draft
Start article.
Review changes View this version of the page
You can also use the and keys
Deletions are marked like this Additions are marked like this

The Critical Factorization Theorem is a fundamental result in combinatorics on words that relates the presence of local repetitions within a word to the overall periodicity of the word.
Create Draft
Contributed by
Except where otherwise noted, text content is licensed under a Creative Commons Attribution-ShareAlike License. See copyright information.