GATE | GATE MOCK 2017 | Question 53
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 2017 MOCK II | Question 15
- GATE | GATE MOCK 2017 | Question 4
- GATE | GATE MOCK 2017 | Question 5
- GATE | GATE MOCK 2017 | Question 6
- GATE | GATE MOCK 2017 | Question 7
- GATE | GATE MOCK 2017 | Question 8
- GATE | GATE MOCK 2017 | Question 9
- GATE | GATE MOCK 2017 | Question 10
- GATE | GATE MOCK 2017 | Question 11
- GATE | GATE MOCK 2017 | Question 12
- GATE | GATE MOCK 2017 | Question 13
- GATE | GATE MOCK 2017 | Question 14
- GATE | GATE MOCK 2017 | Question 3
- GATE | GATE MOCK 2017 | Question 2
- GATE | GATE 2017 MOCK II | Question 14