Skip to content
Related Articles
Open in App
Not now

Related Articles

GATE | Gate IT 2007 | Question 69

Improve Article
Save Article
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

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

Answer: (A)

Explanation: baa is not accepted by B, so B eliminated<br>

in D a is accepted that’s not there in regular expression<br>

C accepts extra expressions

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!