A counterexample to a question of Hof, Knill and Simon
Combinatorics
2020-11-17 v1 Formal Languages and Automata Theory
Abstract
In this article, we give a negative answer to a question of Hof, Knill and Simon (1995) concerning purely morphic sequences obtained from primitive morphism containing an infinite number of palindromes. Proven for the binary alphabet by B. Tan in 2007, we show the existence of a counterexample on the ternary alphabet.
Keywords
Cite
@article{arxiv.1307.1589,
title = {A counterexample to a question of Hof, Knill and Simon},
author = {Sébastien Labbé},
journal= {arXiv preprint arXiv:1307.1589},
year = {2020}
}
Comments
11 pages, 0 figures