Counting distinct squares in a word

The applet below provides an implementation of our algorithm in Java. This page may not function correctly if you do not have Java Runtime Environment v6u1 and the latest Java Plugin.

The following program takes as input a word and an integer that represents the size of the alphabet the word is defined on, and outputs all distinct full word squares compatible with factors of the word. The program will consider as an entry alphabet the prefix of the latin alphabet (starting with "a" and continuing up to the size of the alphabet) and the "^" symbol representing a hole.

Get Java Now!



Valid XHTML 1.0! Valid CSS!