Consider the regular expression R = (a + b)* (aa + bb) (a + b)*<br> Which of…
PYQ GATE 2007
Consider the regular expression R = (a + b)* (aa + bb) (a + b)*<br>
Which of the following non-deterministic finite automata recognizes the language defined by the regular expression R? Edges labeled λ denote transitions on the empty string.
- A.
A
- B.
B
- C.
C
- D.
D
Attempted by 141 students.
Sign up free to check your answer
Sign up freeLoading lesson…

