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 Wilf's theorem. As a corollary, it implies that the length of the minimum solution is less than N = |L| + |R|. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Baba, K., Tsuruta, S., Shinohara, A., & Takeda, M. (2003). On the length of the minimum solution of word equations in one variable. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2747, 189–197. https://doi.org/10.1007/978-3-540-45138-9_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
