GATE 2007-IT
April 5, 2025GATE 2007
April 5, 2025GATE 2007-IT
|
Question 73
|
Consider the regular expression
R = (a + b)* (aa + bb) (a + b)*
Which one of the regular expressions given below defines the same language as defined by the regular expression R?
|
(a(ba)* + b(ab)*)(a + b)+
|
|
|
(a(ba)* + b(ab)*)*(a + b)*
|
|
|
(a(ba)* (a + bb) + b(ab)*(b + aa))(a + b)*
|
|
|
(a(ba)* (a + bb) + b(ab)*(b + aa))(a + b)+
|
Question 73 Explanation:
R = (a+b)* (aa+bb) (a+b)*
Having NFA:
Equivalent DFA:
Having NFA:
Equivalent DFA:
Correct Answer: C
Question 73 Explanation:
R = (a+b)* (aa+bb) (a+b)*
Having NFA:
Equivalent DFA:
Having NFA:
Equivalent DFA: