+1 vote
38 views
A bit string is called legitimate if it contains no consecutive zeros $, e.g., 0101110$ is legitimate, where as $10100111$ is not. Let $a_n$ denote the number of legitimate bit strings of length $n$. Define $a_0=1$. Derive a recurrence relation for $a_n ( i.e.,$  express $a_n$ in terms of the preceding $a_i's).$

edited | 38 views

I think a(n)=a(n-1)+2; a0=1
by Junior (511 points)

Figure 4:

Source :

Discrete mathematics and its applications by Kenneth H. Rosen

by Active (4.5k points)