Papers
Topics
Authors
Recent
Search
2000 character limit reached

A counterexample to a question of Hof, Knill and Simon

Published 5 Jul 2013 in math.CO and cs.FL | (1307.1589v1)

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.

Citations (13)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.