Challenging REs. Construct an RE that specifies each of the following languages of binary strings over the alphabet {0, 1}.
a. All binary strings except 11 or 111
b. Binary strings with 1 in every odd-number bit position
c. Binary strings with at least two 0s and at most one 1
d. Binary strings with no two consecutive 1s
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.