1 votes 1 votes Theory of Computation made-easy-test-series theory-of-computation regular-expression + – Rishi yadav asked Jan 4, 2018 edited Mar 6, 2019 by Aditi Singh Rishi yadav 331 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Harish Karnam commented Jan 4, 2018 reply Follow Share L1 = bba*baa* = {bbba,bbabaa,bbaabaaa,.......} L2 = ab* = {a,ab,abb,abbb,......} L3 = L1/L2 = {bbb,bbaba,bbaabaa,.......} Therefore, L3 = bba*ba* 0 votes 0 votes Rishi yadav commented Jan 5, 2018 reply Follow Share how do i find quotient of two languages what is the procedure is there any reference or video tutorial for this 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L1/L2 means same L1 dfa with some change in final state L1/L2=x {if xy belong to L1 and y belong to L2} since in L1 last is a so in L2 b* as to be €. So L2 =a Draj95 answered Jan 4, 2018 Draj95 comment Share Follow See all 0 reply Please log in or register to add a comment.