GATE | Gate IT 2007 | Question 70

Consider the regular expression R = (a + b)* (aa + bb) (a + b)*

Which deterministic finite automaton accepts the language represented by the regular expression R ?

2007_72
(A) A
(B) B
(C) C
(D) D


Answer: (A)

Explanation: The equivalent NFA is as follows:
gate_70

Table showing transitions between all states is as follows:
gate_70_2

The transition table can be converted to the transition table for DFA:
gate_70_3

Equivalent DFA for the above transition table is:
gate_70_4
Hence option (A) is the required DFA for the given regular expression.



This solution is contributed by Yashika Arora

Quiz of this Question

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.