For a given order n and generating word z, the applet below will calculate (if possible) the shortest word w with subword complexity 2^{n} that contains z. The word w is generated using a connected graph that has an Eulerian path. The applet outputs information about this graph, as well as the resulting word w, its complexity, and its length.
The applet accepts only binary generating words (that is over an alphabet {a,b}) with 0, 1, or 2 holes (where a hole is denoted by '^'). Furthermore, the generating word must contain a nonoverlapping prefix and suffix of length at least n1 that are each full.
This page may not function correctly if you do not have the latest
Java Runtime Environment
and the latest Java Plugin.
