On the length of the minimum solution of word equations in one variable

Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda

Research output: Contribution to journalArticle

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

Original languageEnglish
Pages (from-to)189-197
Number of pages9
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2747
Publication statusPublished - Dec 1 2003

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this