• retagged by
2,199 views
0 0 votes
Can I write $a^* + b^* = (a + b)^*$ ????

4 Answers

2 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
0 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.

Position:
Show:

Related questions

1 1 vote
1 1 answer
70
70 views
GO Classes asked Oct 1
70 views
Consider the following regular expressions over the alphabet$\Sigma=\{a,b\}$.$R_1=a(a\cup b)^*$$R_2=b(a\cup b)^*$If $L(R)$ denotes the language associated with regular ex...
0 0 votes
1 1 answer
404
404 views
L_Rashmi_Dedeepya asked Nov 14, 2024
404 views
Most languages are case sensitive, so keywords can be written only one way, and the regular expressions describing their lexemes are very simple. However, some languages,...