Implementation

This Java applet implements the algorithm Shortest-Abelian-Border. Given a partial word over the alphabet A = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} with holes represented by the caret character (^), this applet computes the shortest abelian border. Example: the input 1^00 will give output 1^0.

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