edited by
7,778 views
42 votes
42 votes

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

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

edited by

7 Answers

Best answer
30 votes
30 votes

DFA given in option A

Here, $S_3$ and $S_4$ are equivalent states and can be minimized.

This results in DFA given in:

https://gateoverflow.in/3523/gate2007-it_71

edited by
30 votes
30 votes
C. Is false since abb not accepted

D. Is false since as or bb not accepted

B.is false since it is not DFA

A. Is the ans .. S3 and S4 are similar States..minimum no.of states are 4
9 votes
9 votes

A)  as it accepts anything (aa or bb )anything
So aa ,bb, aaa,aaaa bbb,bbbb,bbbbbb,bbaaaababba
ababababaababababa or abababababbb will be accepted
and only A satisfies.
Correct if Wrong,

3 votes
3 votes

lets try by elimination:

(B.) it accepts ab which is not in language

(C.) it is not accepting abb which is in language

(D.) it is not accepting aa which is in language

coming to option (A.) it accepts anything containing aa/bb

Answer:

Related questions

47 votes
47 votes
4 answers
1