摘要

We use a decision procedure for the "Fibonacci-automatic" words to solve problems about a number of different sequences. In particular, we prove that there exists an aperiodic infinite binary word avoiding the pattern xxxR. This is the first avoidability result concerning a nonuniform morphism proven purely mechanically.

  • 出版日期2017-1-2
  • 单位MIT