GATE | Gate IT 2007 | Question 69
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.
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
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.