Minimal subshifts with a language pivot property
Abstract
We construct a binary minimal subshift whose words of length n form a connected subset of the Hamming graph for each n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.