Implementation


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 v1.4.2 and the latest Java Plugin.

Directions: List at least two weak periods in ascending order (no repeats) separated by spaces, and enter a nonnegative integer for the number of holes. The applet will output the critical length for the given weak period set and number of holes as well as a counterexample word for one less than the critical length if applicable. WARNING: Applet may take an extremely long time to run for large numbers of holes!

Back

Visit the NSF home page.

Acknowledgement:   This material is based upon work supported by the National Science Foundation under Grant No. DMS-0452020.
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.

OOOGABOOGABOOGA!!


Valid XHTML 1.0! Valid CSS!