how many 10 bit binary strings are there none of which contains the pattern 110
Answers
Answered by
0
• From the graph it is visible that 110->101
• K step into the graph indicates the occurrence of the string in k+3 ways. Each vertex represents substring with a length of 3.
• You can delete the vertices that do not have number 110. number.
• It is also possible to take into account the smaller graph without traces of 110.
• K step into the graph indicates the occurrence of the string in k+3 ways. Each vertex represents substring with a length of 3.
• You can delete the vertices that do not have number 110. number.
• It is also possible to take into account the smaller graph without traces of 110.
Similar questions