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