Minimal subshifts with a language pivot property
arXiv:1901.04688
Abstract
We construct a binary minimal subshift whose words of length n form a connected subset of the Hamming graph for each n.
arXiv comment6 pages
arXiv:1901.04688
We construct a binary minimal subshift whose words of length n form a connected subset of the Hamming graph for each n.
arXiv comment6 pages