0 0 votes Find the equivalent of the Regular Expression:$L_1 = a^* + b^*$ and $L_2 = a^*b^*.$ Which of the following is True?A. $L_1 = L_2$B. $L_1 \cup L_2 = (a + b)^*$C. ${L_{1}}^{*} = {L_{2}}^{*}$D. $None$ Theory of Computation theory-of-computation regular-expression regular-language regular-grammar + – Debargha Mitra Roy 455 views answer comment Share Follow Print See 1 comment 1 1 comment reply simi2426 commented Aug 17, 2024 reply Follow flag Ans is C 1 1 replyShare Please log in or register to add a comment.
0 0 votes A is wrong as L1 can generate string of any length on either a or b while while b can generate string of any no of a followed by any no of b. B wrong l1Ul2 cant generate ba C is coorect any string can be generated by both both becomes(a+b)* Niraj_Kumar answered Dec 6, 2024 Niraj_Kumar comment Share Follow 0 reply Please log in or register to add a comment.