Creator |
|
|
|
|
Language |
|
Publisher |
|
Date |
|
Source Title |
|
Vol |
|
First Page |
|
Last Page |
|
Publication Type |
|
Access Rights |
|
Related DOI |
|
Related DOI |
|
|
Related URI |
|
|
Related URI |
|
Related HDL |
|
Relation |
|
|
Abstract |
We show the tight upperbound of the length of the minimum solution of a word equation L = R in one variable, in terms of the differences between the positions of corresponding variable occurrences in ...L and R. By introducing the notion of difference, the proof is obtained from Fine and Wilfrsquos theorem. As a corollary, it implies that the length of the minimum solution is less than N = |L|+|R|.show more
|