Article ID Journal Published Year Pages File Type
4952366 Theoretical Computer Science 2017 17 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability
Authors
, , , , ,