270 views

2 Answers

Best answer
3 votes
3 votes

 b*a* ={epsilon,b,bb,bbb,a,aa,aaa,ba,bbaa,bbbaaa,....}
 a*b*={epsilon,b,bb,bbb,a,aa,aaa,ab,aabb,aaabbb,...}

 b*a* ⋂ a*b*={epsilon,b,bb,bbb,a,aa,aaa,....}=(a*+b*)

selected by
1 votes
1 votes
we can see the result of intersection will be={epsilon,a,b,aa,bb,aaa,bbb,......} which is equal to a* ⋃ b*

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
0 answers
2
baofbuiafbi asked Nov 14, 2023
151 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.