A one-dimensional shift of finite type with entropy at least log factors onto the full -shift. The factor map is constructed by exploiting the fact that , or a subshift of , is conjugate to a shift of finite type in which every symbol can be followed by at least symbols. We will investigate analogous statements for higher-dimensional shifts of finite type. We will also show that for a certain class of mixing higher-dimensional shifts of finite type, sufficient entropy implies that is finitely equivalent to a shift of finite type that maps onto the full -shift
