The program takes as input a set {x, y} of two partial words such that |x| ≤ |y|, xy ↑ yx, and xy is not (|x|, |y|)-special. The program outputs a partial word z and integers k, l such that x ⊂ z ^{k} and y ⊂ z ^{l}.

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.