1 1 vote Find the equivalent of the Regular Expression: Theory of Computation theory-of-computation regular-expression regular-language regular-grammar + – Debargha Mitra Roy 785 views answer comment Share Follow Print See all 5 Comments 5 5 Comments reply Show 2 previous comments Shaik Masthan commented Aug 4, 2024 reply Follow flag $L_1^+=[a^+]^+ \text{ this should contains }a^+$ $L_2^* = [a^*]^* \text{ this should contains }\epsilon$ So both are not equal. 1 1 replyShare Debargha Mitra Roy commented Aug 5, 2024 reply Follow flag Ok got it. Thank You sir 0 0 replyShare ꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂ commented Aug 5, 2024 reply Follow flag @Debargha Mitra Roy from where u getting these questions bro.. i mean the questions u r posting kinda tricky and sometimes good one also .. 1 1 replyShare Please log in or register to add a comment.
Best answer 2 2 votes Option - C L1 = a+ L2 = a*L1+ = (a+)+ = a+ ; L1* = (a+)* = a*L2+ = (a*)+ = a* ; L2* = (a*)* = a*So, L1* = L2+ is correct. Torpedo answered Aug 8, 2024 • selected Aug 8, 2024 by Debargha Mitra Roy Torpedo comment Share Follow 0 reply Please log in or register to add a comment.