Register

If a language(L1) is Recursive (REC) and L2 is Recursive (REC) , then what will be L1-L2 ?

338 views
0 votes
0 votes
If a language(L1) is Recursive  (REC) and L2 is Recursive (REC) , then what will be L1-L2 ?
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

3 votes
3 votes
2 answers
1
Sandeep Verma asked Nov 12, 2017
2,283 views
If a language(L1) is Recursive enumerable (RE) and L2 is Recursive (REC) , then what will be L1-L2 ?
If a language(L1) is Recursive enumerable (RE) and L2 is Recursive (REC) , then what will be L1 - L2 ? Can we directly use set difference property or do the s...
User Avatar
2 votes
2 votes
0 answers
2
Sandeep Verma asked Nov 10, 2017
355 views
If a language(L) is Context-free, or CSL or RL , then it will always be Recursive ?
If a language(L) is Context-free, or CSL or RL , then it will always be Recursive ?
If a language(L) is Context-free, or CSL or RL , then it will always be Recursive ?
User Avatar
5 votes
5 votes
4 answers
3
Purple asked Jan 28, 2016
8,847 views
If L1 is Regular, and L1UL2 is regular, then L2 is?
Consider L1, L2 ⊆ Ʃ* such that L1 and L1 ∪ L2 are regular. (a) L2 is definitely regular (b) L2 may not be regular (c) L2 is context free (d) None of above Is it option B or C? How?
Consider L1, L2 ⊆ Ʃ* such that L1 and L1 ∪ L2 are regular.(a) L2 is definitely regular(b) L2 may not be regular(c) L2 is context free(d) None of aboveIs it option B ...
User Avatar
0 votes
0 votes
2 answers
4
Ujjwal Saini 1 asked Nov 23, 2014
2,539 views
Let L1 is regular and L2 is CFG. Then what is L1-L2?
(A) Regular (B)CFG (C)Deterministic CFG (D) Context Sensitive
(A) Regular (B)CFG(C)Deterministic CFG (D) Context Sensitive
User Avatar
Link Copied!