2000 character limit reached
A counterexample to a question of Hof, Knill and Simon (1307.1589v1)
Published 5 Jul 2013 in math.CO and cs.FL
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.