1,152 views
3 votes
3 votes

Part A:
Given : (b|ab*ab*)* 

How can it be interpreted as:
1.((b+ab*)ab*)* 
2.(b+(ab*ab*))*

3.((b+a)b*ab*)*

Part B:

1.What will be its NFA ? 

2.Can we draw a direct MINIMAL DFA for such questions?

1 Answer

Best answer
4 votes
4 votes

............

selected by

Related questions

0 votes
0 votes
1 answer
1
goluabhinan asked Sep 11, 2018
813 views
Consider the regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is ____________.
0 votes
0 votes
2 answers
2
0 votes
0 votes
2 answers
3
iarnav asked Mar 14, 2019
918 views
Given L = { 0*1 + 0 + 1* + 10*1}where + symbol is UNION and NOT positive closure.Please draw the Minimal DFA for this.
0 votes
0 votes
1 answer
4
M_Umair_Khan42900 asked Dec 29, 2022
780 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...