= Subshift of finite type
{wiki=Subshift_of_finite_type}
A **subshift of finite type** (SFT) is a concept from the field of symbolic dynamics, a branch of mathematics that studies sequences of symbols and their dynamics. An SFT is defined on a finite alphabet and is characterized by the restrictions on the allowable sequences of symbols. Here's a breakdown of the key components of a subshift of finite type: 1. **Alphabet**: An SFT is defined over a finite set of symbols, often referred to as an alphabet.
Back to article page