= Subshift of finite type
{title2=$\Sigma_A=\{x\in\{1,\ldots,m\}^{\mathbb Z}:A_{x_kx_{k+1}}=1\text{ for all }k\}$}
{wiki}
= Shift of finite type
{synonym}
A subshift of finite type is a <closed subset> of a finite-alphabet <full shift> defined by finitely many forbidden finite words, with the restricted <left shift>. After replacing symbols by sufficiently long blocks, its constraints can be described by a zero-one <symbolic transition matrix>. In this presentation, membership means that every consecutive pair follows an allowed transition. The resulting <sequence> space is a <compact metric space> and the restricted <left shift> is a <homeomorphism>.
Back to article page
