1 votes 1 votes A / B = { w | wx ∈ A for some x ∈ B }. Show that if A is regular and B is any language, then A / B is regular. Theory of Computation regular-language theory-of-computation + – amrendra pal asked Aug 22, 2017 amrendra pal 227 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes L1= 10*1 L2=0*1 L1= { 11,101,1001,10001, ......} L2={1.01,001,0001,00001,......} L1/L2 ={ 1,10,100,1000,10000,....} i.e 10* Hence Regular yogi_p answered Aug 23, 2017 yogi_p comment Share Follow See 1 comment See all 1 1 comment reply amrendra pal commented Aug 23, 2017 reply Follow Share @yogi_p , can you give the source of above solution ? 0 votes 0 votes Please log in or register to add a comment.