Conjugacy Equation on Partial Words



For non-empty partial words x, y, and z, with |x| = |y|, xz is compatible with zy if and only if xzy is weakly |x|-periodic.

The program takes as input three partial words x, y and z such that x and y have the same length and xz and zy are compatible.
The program will output a factorization of the partial words x, y, and z and will show that xzy is weakly |x|-periodic.

Valid XHTML 1.1!

Valid CSS!

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.