341 views
2 votes
2 votes
Intersection of two Recursive enumerable language or two recursive language or two CSL is undecidable then how it can be said that it is closed under intersection??

Thank You

1 Answer

Best answer
1 votes
1 votes
RE ,CSL ,REC are closed under intersection.So the answer to decision problem is always "YES". Its trivial.So,it is deciadable.
selected by

Related questions

3 votes
3 votes
2 answers
1
0 votes
0 votes
1 answer
2
gateexplore asked Jun 11, 2023
411 views
Construct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by an odd number of 1's and ending with any number of 2's. Please give the answ...
0 votes
0 votes
0 answers
3
vishnu777 asked Nov 24, 2022
201 views
Can anyone explain what is the meaning of saying set of some languages is another language.Ex: L1,L2,L3.....Ln are some languages then i define L={L1,L2,L3.....Ln} which ...
1 votes
1 votes
2 answers
4