0 votes 0 votes Given L1 = (bba*baa*) and L2 = (ab*). The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by A)bba*b B)bba*baa* C)bba*ba* D)None of these Theory of Computation theory-of-computation regular-expression + – Jaspreet Kaur Bains asked Dec 7, 2017 • recategorized Jun 20, 2022 by Lakshman Bhaiya Jaspreet Kaur Bains 295 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes answer must be C) SHUBHAM SHASTRI answered Dec 7, 2017 SHUBHAM SHASTRI comment Share Follow See all 0 reply Please log in or register to add a comment.