recategorized by
565 views

1 Answer

Best answer
1 votes
1 votes
both b and c are right. c is in simplified form compared to b.
edited by
Answer:

Related questions

0 votes
0 votes
1 answer
1
goluabhinan asked Sep 11, 2018
814 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
3 votes
3 votes
1 answer
3
ashishgateashish asked Mar 13, 2018
1,157 views
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 f...
0 votes
0 votes
0 answers
4
iarnav asked Jan 30, 2018
202 views
L = anbm / n,m>=1What type pf Language is this? Also, please tell are n,m are independent or dependent i.e can we have like n=2 and m=3 or both n,m have to have same valu...