Question: Need help with Combinatorics Problem!!!! Let T be the set of all binary strings where any block of 1's of length at least 3 cannot
Need help with Combinatorics Problem!!!!

Let T be the set of all binary strings where any block of 1's of length at least 3 cannot be followed by a block of 0's of length at least 3, and any black of 1's of length at most 2 must be followed by a block of 0's whose length is congruent to 2 modulo 3. (3) Determine an unambiguous expression for T. Explain your answer. (b) Prove that the number of strings in T of length n is 1+x4+x5 lx2x3+x7+x3- [16"]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
