Which of the following regular expressions describes the language over {0, 1}…
GATE · 2008 · IT
Which of the following regular expressions describes the language over {0, 1} consisting of strings that contain exactly two 1's?
- A.
(0 + 1) * 11(0 + 1) *
- B.
0 * 110 *
- C.
0 * 10 * 10 *
- D.
(0 + 1) * 1(0 + 1) * 1 (0 + 1) *
Attempted by 262 students.
Sign up free to check your answer
Sign up freeLoading lesson…