Crowdly
Add to Chrome
1. Find the recurrence relation for number of n-length words using a, b, ...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
1. Find the recurrence relation for number of n-length words using a, b, c letters that can be transmitted where no word having two consecutive a’s.
❌
❌
✅
❌