Register

Kenneth Rosen Edition 7 Exercise 8.1 Question 13 (Page No. 511)

• edited by
384 views
1 votes
1 votes

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?$
• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

381
views
2 answers
1 votes
admin asked May 2, 2020
381 views
Kenneth Rosen Edition 7 Exercise 8.1 Question 25 (Page No. 511)
How many bit sequences of length seven contain an even number of $0s?$
User Avatar
203
views
0 answers
0 votes
admin asked May 2, 2020
203 views
Kenneth Rosen Edition 7 Exercise 8.1 Question 24 (Page No. 511)
Find a recurrence relation for the number of bit sequences of length $n$ with an even number of $0s.$
User Avatar
265
views
0 answers
0 votes
admin asked May 2, 2020
265 views
Kenneth Rosen Edition 7 Exercise 8.1 Question 23 (Page No. 511)
Find the recurrence relation satisfied by $S_{n},$ where $S_{n}$ is the number of regions into which three-dimensional space is divided by $n$ planes if every ... four of the planes go through the same point.Find $S_{n}$ using iteration.
User Avatar
264
views
0 answers
0 votes
admin asked May 2, 2020
264 views
Kenneth Rosen Edition 7 Exercise 8.1 Question 22 (Page No. 511)
a) Find the recurrence relation satisfied by $R_{n},$ where $R_{n}$ is the number of regions into which the surface of a sphere is divided by $n$ great ... of the great circles go through the same point.b) Find $R_{n}$ using iteration.
User Avatar
Link Copied!