Recurrence Relations · Transfer-Matrix Method (Optional)
Lesson 5
Problem. Over the alphabet \(\Sigma=\{a,b,c\}\), suppose that the forbidden adjacent pairs are \(aa\), \(bc\), and \(ca\). How many valid words of length \(5\) are there?
5 points
Recurrence Relations · Transfer-Matrix Method (Optional)
Problem. Over the alphabet \(\Sigma=\{a,b,c\}\), suppose that the forbidden adjacent pairs are \(aa\), \(bc\), and \(ca\). How many valid words of length \(5\) are there?