Abelian Periods on Partial Words

F. Blanchet-Sadri     Amelia Tebbe     Amy Veprauskas

Implementation 1

This applet constructs an optimal full word with abelian periods p and q. For p and q with gcd>1, this applet produces the optimal word for the case where the periods match up.

Your browser is not Java enabled.

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

---

Acknowledgement:   This material is based upon work supported by the National Science Foundation under Grant No. DMS-0754154. The Department of Defense is also gratefully acknowledged . Disclaimer:   Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.