Let, init (L) = {set of all prefixes of L},
Let L = {w | w has equal number of 0’s and 1’s}
init (L) will contain:
(A) all binary strings with unequal number of 0’s and 1’s
(B) all binary strings with ԑ-string
(C) all binary strings with exactly one more 0’s than number of 1’s
(D) None of above
Answer: (B)
Explanation:
Clearly init (L) = (0+1)*. Take any string in (0+1)* say 101011, we can append required number of symbols to make it a member of L like 10101100.
Recommended Posts:
- GATE | GATE MOCK 2017 | Question 49
- GATE | GATE 2017 MOCK II | Question 29
- GATE | GATE MOCK 2017 | Question 46
- GATE | GATE 2017 MOCK II | Question 30
- GATE | GATE 2017 MOCK II | Question 31
- GATE | GATE MOCK 2017 | Question 45
- GATE | GATE MOCK 2017 | Question 44
- GATE | GATE 2017 MOCK II | Question 32
- GATE | GATE 2017 MOCK II | Question 33
- GATE | GATE 2017 MOCK II | Question 34
- GATE | GATE 2017 MOCK II | Question 36
- GATE | GATE 2017 MOCK II | Question 37
- GATE | GATE 2017 MOCK II | Question 38
- GATE | GATE 2017 MOCK II | Question 28
- GATE | GATE MOCK 2017 | Question 47
- GATE | GATE 2017 MOCK II | Question 21
- GATE | GATE MOCK 2017 | Question 48
- GATE | GATE 2017 MOCK II | Question 22
- GATE | GATE 2017 MOCK II | Question 23
- GATE | GATE 2017 MOCK II | Question 24
