Find all strings of length 4 over the alphabet {0, 1, 2} with the property that there are no 10, 21, or 20 substrings.
Find a recurrence relation for the number of ternary strings of length n that do not contain two consecutive 0s or two consecutive 1s.