0 votes 0 votes Find a recurrence relation for the number of ternary strings of length $n$ that do not contain consecutive symbols that are the same. What are the initial conditions? How many ternary strings of length six do not contain consecutive symbols that are the same? Combinatory kenneth-rosen discrete-mathematics counting descriptive + – admin asked May 2, 2020 • edited May 2, 2020 by Lakshman Bhaiya admin 156 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.