Which one of the following regular expressions is equivalent to the language…
GATE · 2024 · CS · Set 2 · Computer Science & IT
Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?
- A.
0∗1(0 + 10∗1)∗
- B.
0∗ (10∗11)∗0∗
- C.
0∗1(010∗1)∗0∗
- D.
0(1 + 0∗10∗1)∗0∗
Attempted by 272 students.
Sign up free to check your answer
Sign up freeLoading lesson…