0 votes 0 votes How come L1∩ L2 = (L1' U L2')' Theory of Computation theory-of-computation + – iarnav asked Sep 11, 2017 iarnav 478 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply G.K.T commented Sep 11, 2017 reply Follow Share considering L1 and L2 any two arbitrary sets you may also realise such equations through venn diagram 2 votes 2 votes iarnav commented Sep 12, 2017 reply Follow Share @G.K.T May you please draw the Venn diagram and shade the regions and kindly explain? 0 votes 0 votes G.K.T commented Sep 12, 2017 reply Follow Share hopefully you'll get some realization from this 2 votes 2 votes iarnav commented Sep 12, 2017 reply Follow Share @G.K.T Awesome! Thanks 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes By De-Morgans Law. Languages are sets. Rishabh Gupta 2 answered Sep 11, 2017 Rishabh Gupta 2 comment Share Follow See all 3 Comments See all 3 3 Comments reply iarnav commented Sep 12, 2017 reply Follow Share @Rishabh Gupta 2 May you please elaborate a bit more by taking some example! 0 votes 0 votes Rishabh Gupta 2 commented Sep 12, 2017 reply Follow Share It will be good if you read it yourself. Consider languages as sets. 0 votes 0 votes iarnav commented Sep 12, 2017 reply Follow Share Alright, will do, thanks. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes this is same as set operation.... L1'={some +L2 - common in both} L2'={some +L1-common in both} (L1+L2)'={which is present in L1 as well as L2(i.e common strings)} hs_yadav answered Sep 11, 2017 hs_yadav comment Share Follow See all 0 reply Please log in or register to add a comment.