retagged by
923 views
0 votes
0 votes
Can I write $a^* + b^* = (a + b)^*$ ????
retagged by

4 Answers

2 votes
2 votes

NO,

we can write (a+b)*=(a*+b*)*

                               =(a*+b)*

                               =(a+b*)*

                               =(a*b*)*

                               =a*(ba*)* 

                               =b*(ab*) *

 

or

make minimal dfa for both the RE and check LHS != RHS ,infact  language both are different 

 

edited by
1 votes
1 votes

$1^{st}$ one is RHS.
$2^{nd}$ one is LHS.
LHS $\neq$ RHS

0 votes
0 votes

No ,because both are not same as u can see by the 1st REstring produce like ab,aabb.a,b,aa,bbetc but u can't get string like aba,aaabbabab,ababa etc .

whereas by the 2nt RE u will get all string produce by a and b.

Related questions

1 votes
1 votes
1 answer
1
prabhath challa asked 5 days ago
52 views
what will be the regular expression of this DFA using Arden's theorem
0 votes
0 votes
1 answer
2
hasina ali asked Mar 21
85 views
Set of binary strings starting with 11 and ending with 00. E.g., 1100,1110100 ,1100100
0 votes
0 votes
1 answer
3
utsav22222 asked Mar 15
126 views
Write regular expression for the set of strings of 0's and 1's with at most one pair of consecutive 1's.