# Minimal subshifts with a language pivot property

## TL;DR

This paper constructs a binary minimal subshift where, for each word length, the set of words forms a connected subset in the Hamming graph, revealing new structural properties of such dynamical systems.

## Contribution

It introduces a novel example of a minimal subshift with a connected language structure in the Hamming graph for all word lengths.

## Key findings

- Words of each length form a connected subset in the Hamming graph
- Provides a new example of minimal subshifts with specific language connectivity
- Enhances understanding of the structure of minimal dynamical systems

## Abstract

We construct a binary minimal subshift whose words of length n form a connected subset of the Hamming graph for each n.