This algorithm calculates the number of distinct non-trivial abelian circular squares in a binary partial word with at most two holes and lists their Parikh vectors.
Insert a string of binary digits, and use any character other than 0 or 1 to indicate a hole.

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