Let w be an equality word of two nonperiodic binary morphisms g, h : {a,b}~* → △~*. Suppose that no overflow occurs twice in w and that w contains at least 9 occurrences of a and at least 9 occurrences of 6. Then either w = (ab)~ia, or w = a~ib~j with gcd(i, j) = 1, up to the exchange of letters a and b.
展开▼
