The Baum–Sweet word 1101100101001001..., which is created by concatenating the terms of the Baum–Sweet sequence, is a fixed point of the morphism or string substitution rules  as follows:  From the morphism rules it can be seen that the Baum–Sweet word contains blocks of consecutive 0s of any length ("b""n" = 0 for all 2"k" integers in the range 5.2"k" ≤ "n" "k"), but it contains no block of three consecutive 1s. More succinctly, by Cobham's little theorem the Baum–Sweet word can be expressed as a coding formula_17 applied to the fixed point of a uniform morphism formula_18. Indeed, the morphism  and coding  generate the word in that way.