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