Commutativity Equation on Partial Words



Let x and y be non-empty partial words such that |x| |y| .

If the partial word xy is compatible with the partial word yx, (xy yx), and xy is not (|x|, |y|)-special, then there exists a word z such that x is contained in z k, (x zk), and y z l for some integers k and l.

The program takes as input a set {x, y} of two partial words such that |x| ≤ |y|, xyyx, and xy is not (|x|, |y|)-special.

, }

Valid XHTML 1.1!

Valid CSS!

Visit the NSF home page.

