Home - Brings you to this page.

Absract - Displays the abstract for "Codes, Orderings, and Partial Words" in XHTML format.

Paper - Displays the paper "Codes, Orderings, and Partial Words" in PDF format. You will need to have a PDF reader installed in order to view the paper; click the icon below to get one:

Implementation - This will carry you to a series of web pages that use the algorithms from "Codes, Orderings, and Partial Words" to determine if a set of partial words is a pcode.

This process will begin by asking for the size of your set, then the partial words in your set. If your set is not pairwise compatible, a program will calculate the simplified domino graph and test to see if there is a path from open to close. You will then be told if your set is a pcode or not.

If your set is pairwise compatible, your set will be displayed, and two of the members of your set will be shown to be compatible.

If there is a valid path (your set is not a pcode), one valid path will be shown; the two factorizations associated with this path will also be shown to be compatible. Whether your set has a valid path or not, the calculated edges will be displayed.