Problem 2: Derive the formula for the number of strings formed from letters A, B, C that do not contain substrings BAA o
Posted: Sun May 15, 2022 10:02 am
Problem 2: Derive the formula for the number of strings formed from letters A, B, C that do not contain substrings BAA or CAA. Your solution must consist of a recurrence equation, with a complete justification, followed by a solution of this recurrence, showing your work. (Hint: See the exercise on slide 52.)