in Combinatory edited by
321 views
1 vote
1 vote

A string that contains only $0s, 1s,$ and $2s$ is called a ternary string.

  1. Find a recurrence relation for the number of ternary strings of length $n$ that do not contain two consecutive $0s.$ 
  2. What are the initial conditions?
  3. How many ternary strings of length six do not contain two consecutive $0s?$
in Combinatory edited by
by
321 views

1 Answer

0 votes
0 votes

kenneth rosen 

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