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