edited by
156 views
0 votes
0 votes
  1. Find a recurrence relation for the number of ternary strings of length $n$ that do not contain consecutive symbols that are the same.
  2. What are the initial conditions?
  3. How many ternary strings of length six do not contain consecutive symbols that are the same?
edited by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
2 answers
1
admin asked May 2, 2020
347 views
How many bit sequences of length seven contain an even number of $0s?$
0 votes
0 votes
0 answers
2
admin asked May 2, 2020
188 views
Find a recurrence relation for the number of bit sequences of length $n$ with an even number of $0s.$