No title
Abstract of chapter 1 For n >= 2 the number of mixing n-step subshifts of finite type (sft) over the alphabet {0, 1} is proven to be at least 15/16 times the number of transitive n-step sfts. A conjecture assumes the latter to be at least 2^(3*2^(n-1)-n). Abstract of chapter 2 The alternating colouring function is defined. Strings over the alphabet {0, 1} are divided in colourable and non-coloura
