Abstract
For any subshift, define to be the collection of distinct follower sets of words of length in . Based on a similar result of the second and third authors, we conjecture that if there exists an for which , then is sofic. In this paper, we prove several results related to this conjecture, including verifying it for , proving that the conjecture is true for a large class of coded subshifts, and showing that if there exists for which , then is sofic.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.