Minimum Number of Holes in Unavoidable Sets

The following implementation provides the user with a way to check whether a two-sided infinite word (w^Z) avoids a set of three partial words of uniform length over a binary alphabet.


1. Enter a word (w).

2. Change the length of the words if needed using "Resize".

3. Provide the set of partial words of uniform length to be avoided.

4. Click "Check" to test if w^Z avoids the set, or "Generate" to find the shortest avoiding word.

Note: The alphabet is A={a,b} and * is the 'hole' symbol.

Oops! It seems like you don't have the latest JRE. You can get it here.