Register

closure properties

762 views
0 votes
0 votes

I think the question is wrong , it is related to closure properties of NP problems and NP problems are recursive so closed under concatenation, intersection, union, set difference.

Correct me if i am wrong..

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
UltraRadiantX asked Oct 9, 2021
471 views
Closure Properties of Languages
let L = “CFL but not REGULAR”, Can we get complement of L as CFL? Unlike in the case of Recursively Enumerable(RE) language where if L = “RE but not RECURSIVE”, its complement can never be RE.
let L = “CFL but not REGULAR”, Can we get complement of L as CFL?Unlike in the case of Recursively Enumerable(RE) language where if L = “RE but not RECURSIVE”, it...
User Avatar
4 votes
4 votes
1 answer
3
anurag sharma asked Dec 24, 2018
1,899 views
Closure Properties
What is difference between Σ* and L* ? Which is true ? S1 : Σ* – {ϵ} = Σ+ S2 : L* – {ϵ} = L+ .
What is difference between Σ* and L* ? Which is true ?S1 : Σ* – {ϵ} = Σ+S2 : L* – {ϵ} = L+ .
User Avatar
0 votes
0 votes
0 answers
4
dragonball asked Dec 20, 2017
525 views
Closure properties
Subset of Regular Language is REL or not ? PLz Explain with an Example.
Subset of Regular Language is REL or not ?PLz Explain with an Example.
User Avatar
Link Copied!