Determine the unambigious expression which generates every string in this set. The set of all binary strings which contains 001111 as a substring.
I am thinking that the answer should be
But the answer says that it should be
Which is basically to take all the strings, and remove those that do not contain 001111 as a substring. Is my answer correct also, or is the 2nd one more correct?
Sorry if this is in the wrong section, as I couldn't find the Binary strings tag