Minimal subshifts with a language pivot property
Dynamical Systems
2019-01-16 v1 Formal Languages and Automata Theory
Abstract
We construct a binary minimal subshift whose words of length n form a connected subset of the Hamming graph for each n.
Cite
@article{arxiv.1901.04688,
title = {Minimal subshifts with a language pivot property},
author = {Ville Salo},
journal= {arXiv preprint arXiv:1901.04688},
year = {2019}
}
Comments
6 pages