English

Equation $x^iy^jx^k=u^iv^ju^k$ in words

Formal Languages and Automata Theory 2019-12-18 v1

Abstract

We will prove that the word aibjaka^ib^ja^k is periodicity forcing if j3j \geq 3 and i+k3i+k \geq 3, where ii and kk are positive integers. Also we will give examples showing that both bounds are optimal.

Keywords

Cite

@article{arxiv.1501.03602,
  title  = {Equation $x^iy^jx^k=u^iv^ju^k$ in words},
  author = {Jana Hadravová and Štěpán Holub},
  journal= {arXiv preprint arXiv:1501.03602},
  year   = {2019}
}