6 votes 6 votes Given L1=L(a*baa*) L2=L(ab*). The regular expression corresponding to language L3=L1/L2 (right quotient) is given by a*b a*baa* a*ba* None of the above Theory of Computation ugcnetcse-june2013-paper2 theory-of-computation right-quotient + – go_editor asked Jul 14, 2016 • recategorized Nov 2, 2017 by Sanjay Sharma go_editor 5.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
9 votes 9 votes L1={a*baa*}={ba,aba,abaa,abaaa*,aa*baaa*,a*ba*a.....} L2={ab*}={a,ab,abb*...} L1/L2=a*ba* {=b,ab,aba,abaa,a*baa....} so ans is C L1/L2={x: xy belongs to L1 for some y belongs to L2} Sanjay Sharma answered Jan 21, 2017 Sanjay Sharma comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Sanjay Sharma commented Apr 3, 2019 reply Follow Share which statement or line 0 votes 0 votes Sanjay Sharma commented Apr 3, 2019 reply Follow Share Option A cant have strings like aba abaa ... which are present in L1/L2 0 votes 0 votes Sanjay Sharma commented Apr 3, 2019 reply Follow Share Option A cant have strings like aba abaa ... which are present in L1/L2. PS we take only those strings of L1 that has some y belongs to L2 as suffix 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L1 ={ba,aba,abaa,baa,..................} L2={ab*} L1 / L2 operation not successful here So, Ans D) srestha answered Jul 14, 2016 srestha comment Share Follow See all 0 reply Please log in or register to add a comment.