Subwords of Partial Words

F. Blanchet-Sadri, Mark Heimann, Andrew Lohr

Implementation Implementation Paper


Enter a set of full words of uniform length on a binary alphabet. The applet will produce a representation partial word (where the hole symbol is represented by ^) of minimal length if the set is representable.

For example, entering "aab bba aaa baa" will produce "b^aa^" or "b^aab"




Enter a full or partial word over the binary alphabet {a, b} where ^ is the wildcard character. The applet will find the maximum order for which the word is 2n-complex.



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