Minimal subshifts with a language pivot property
classification
🧮 math.DS
cs.FL
keywords
minimalbinaryconnectedconstructformgraphhamminglanguage
read the original abstract
We construct a binary minimal subshift whose words of length n form a connected subset of the Hamming graph for each n.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.