Question

1/ Assume that A and B are regular language, then prove that

i/ (AUB) a regular language

ii/ ( A and B) a regular language

iii/ A concatenate B a regular language

  

Answer 1

Domain Set ot all ngular langunges over E' All regula danguages at tb)* at Requla u Regulo]- Regela language Union Latb 2 L L2- Any 3 a* L2 Any LIUL2=L LUL-L2 LULatB 4 La B L is accepted bj m, acepted by L2- a* UL=L LU-atb)t 6. Prime 1* L2 :

Intersection Reqeda language are closed unde interection (atb) n any any L2 CLthen & n any- L,UL2 L L,OLL2 atbnata 5. acatb nb(atb)- nefa a 7 a*b ab - ab 8.ab nat-

closed unden Concatenation: Requla languages ar Concatenation Re Reg Requla L2. L 4.L2 L2 LI Catb* atb at atb)* atb)* ax at b

Note: I can't explain better than this. I tried my best.

Please give upvote if you understand