By analogy, it would be a poor idea for a language model to score a string highly if it could be segmented into independently frequent n-grams.
since each character in Σ is actually a 4-tuple, this trigram machine is fairly large.