The Gateway to Computer Science Excellence
+1 vote
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).$
in Combinatory by Veteran (106k points)
edited by | 39 views

2 Answers

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


Figure 4:

Source :

Discrete mathematics and its applications by Kenneth H. Rosen

by Active (4.7k points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,397 answers
105,454 users