Register

UGC NET CSE | June 2012 | Part 3 | Question: 43

• edited by
4,374 views
3 votes
3 votes

The regular expression for the following DFA

  1. ab*(b+aa*b)*
  2. a*b(b+aa*b)*
  3. a*b(b*+aa*b)
  4. a*b(b+aa*b)*
• edited by
User Avatar

1 Answer

Best answer
2 votes
2 votes

(A)It can't accept strings aab, aaab, aaaab.... which is accepted by given DFA.

So, we can eliminate this option. 

(C)a*b(b*+aa*b) in this option first we can generate any number of a's after we can generate any numbers of b's or any number of a's is followed by a single b.

It can not generate string abbaabbb which can accept by given DFA.So, we can eliminate this option. 

Answer should be both (B) and (D) here.

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
go_editor asked Jul 7, 2016
4,016 views
UGC NET CSE | June 2012 | Part 3 | Question: 35
Consider the regular expression (a+b)(a+b) ..... (a+b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains n states n+1 states n+2 states 2$^n$ states
Consider the regular expression (a+b)(a+b) ..... (a+b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regula...
User Avatar
2 votes
2 votes
2 answers
2
go_editor asked Jul 7, 2016
4,993 views
UGC NET CSE | June 2012 | Part 3 | Question: 52
Match the following : ... $\text{(i)-(c), (ii)-(b), (iii)-(d), (iv)-(a)}$
Match the following :$\begin{array} {clcl} \text{(i)}& \text{Regular grammer} & \text{(a)} & \text{Pushdown automaton} \\ \text{(ii)}& \text{Context free grammer} & \tex...
User Avatar
Link Copied!