The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
4 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$').

asked in Others by Veteran (103k points)
reshown by | 4 views

Please log in or register to answer this question.



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

41,063 questions
47,662 answers
147,330 comments
62,381 users