Consider the set $S$ of all strings of $a$ 's and $b$ 's. For each integer $n \geq 0$ , let
a_n = the number of strings of length n that do not contain the pattern bb.
Find a recurrence relation for $a _ { 1 } , a _ { 2 } , a _ { 3 } , \ldots$ . Explain your answer carefully.

Question

Consider the set

S

of all strings of

a

's and

b

's. For each integer

n \geq 0

, let
a_n = the number of strings of length n that do not contain the pattern bb.
Find a recurrence relation for

a _ { 1 } , a _ { 2 } , a _ { 3 } , \ldots

. Explain your answer carefully.

Quizplus · Accepted Answer

The Answer of Consider the set $S$ of all strings of $a$ 's and $b$ 's. For each integer $n \geq 0$, let a_n = the number of strings of length n that do not contain the pattern bb. Find a recurrence relation for $a _ { 1 } , a _ { 2 } , a _ { 3 } , \ldots$. Explain your answer carefully.

Consider the Set SSS Of All Strings Of aaa 'S And bbb 'S for Each Integer

Consider the Set $S$ Of All Strings Of $a$ 'S And $b$ 'S for Each Integer