Consider a language that uses the alphabet {A, B, C} In this language words obey one single rule: a B cannot follow a B. How many words of length n exist in this language?
How do i go about solving this and what should i use in discrete math as a tool?