Counting Partial Words

This applet may not work properly if you do not have Java Runtime Environment v7u5 and the latest Java Plugin.

Enter a pattern of interest such as AABBA. The applet will list the known avoidability properties of the pattern in partial words. Note that partial word avoidability indices are known for unary, binary, and most ternary patterns, and minimum hole sparsities over a binary alphabet are known for unary and most binary patterns. The applet will also check if a pattern with known index or min sparsity divides the pattern entered, and display the appropriate upper bound.