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.

2007_71

  1. A.

    A

  2. B.

    B

  3. C.

    C

  4. D.

    D

Attempted by 141 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…