Find the number of ternary strings (using A,B,C,D) of length n such that it doesn’t contain the substring “AA”. Just the recurrence relation…

Find the number of ternary strings (using A,B,C,D) of length n such that it doesn’t contain the substring “AB”. Just the recurrence relation…

I just wanted to know how the first question’s approach is different from the second’s question…