Subshifts with Slowly Growing Numbers of Follower Sets

preprint2015arXivOpen access

Abstract

For any subshift, define FX(n)F_X(n) to be the collection of distinct follower sets of words of length nn in XX. Based on a similar result of the second and third authors, we conjecture that if there exists an nn for which ∣FX(n)∣≤n|F_X(n)| \leq n, then XX is sofic. In this paper, we prove several results related to this conjecture, including verifying it for n≤3n \leq 3, proving that the conjecture is true for a large class of coded subshifts, and showing that if there exists nn for which ∣FX(n)∣≤log⁡2(n+1)|F_X(n)| \leq \log_2(n+1), then XX is sofic.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.