3. (1.5 marks) Let fn be the number of binary strings of length n which do not contain a factor 111 and have final digit
Posted: Fri Apr 29, 2022 6:32 am
Please solve both parts to get upvote asap
3. (1.5 marks) Let fn be the number of binary strings of length n which do not contain a factor 111 and have final digit 0. (a) What is fo, f1, 82, 83, fa? 5 (b) Find a recursive formula for fn.
3. (1.5 marks) Let fn be the number of binary strings of length n which do not contain a factor 111 and have final digit 0. (a) What is fo, f1, 82, 83, fa? 5 (b) Find a recursive formula for fn.