0
$\begingroup$

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?

  • 3
    You are flooding the system with questions. If you need that much help, you're better off going to your teacher to ask for help, or perhaps hiring a tutor. In any event, ask one question, wait for an answer, meditate on it until you understand it, then you'll be in a better position to ask a second question.2012-04-20
  • 0
    Sorry i understand.2012-04-20
  • 0
    This was discussed at meta, e.g. [here](http://meta.math.stackexchange.com/questions/3472/how-much-asking-is-too-much) and [here](http://meta.math.stackexchange.com/questions/610/user-flooding-the-site-with-questions-more-than-6-day). It is mentioned there that at most 50 questions a month are allowed - if you try to post more, the site will not accept new question. At the current rate you would use your 50 questions pretty fast.2012-04-20

1 Answers 1