0 votes 0 votes Is intersction of two languages is also a language of the same type? RE AND REC which languages is decidable and un undecidable Theory of Computation theory-of-computation + – amit166 asked Jan 31, 2019 edited Jan 31, 2019 by amit166 amit166 260 views answer comment Share Follow See 1 comment See all 1 1 comment reply balchandar reddy san commented Jan 31, 2019 reply Follow Share Intersection of RE and Rec is RE Intersection of RE and RE is also RE, as RE is close under intersection.. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes intersection of {} which is regular and {a^p|p is prime}which is csl is null which is will know regular. Rec means decidable RE is undecidable shubham9028 answered Jan 31, 2019 shubham9028 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes No, intersection of two language may or may not be same language of same type . Ex: L1= a^nb^nc^m L2= a^mb^mc^m L1 intersection L2 = a^nb^nc^n which is csl abhishekmehta4u answered Mar 26, 2019 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.