@inbook{b9bc7ebe3d2f43d68e895ec4497a95b0,

title = "On the length of the minimum solution of word equations in one variable",

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|.",

author = "Kensuke Baba and Satoshi Tsuruta and Ayumi Shinohara and Masayuki Takeda",

year = "2003",

doi = "10.1007/978-3-540-45138-9_13",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "189--197",

editor = "Branislav Rovan and Peter Vojtas",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}