Register

If a language(L) is Context-free, or CSL or RL , then it will always be Recursive ?

355 views
2 votes
2 votes
If a language(L) is Context-free, or  CSL or   RL , then  it will  always be Recursive ?
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
0 answers
1
Sandeep Verma asked Nov 13, 2017
338 views
If a language(L1) is Recursive (REC) and L2 is Recursive (REC) , then what will be L1-L2 ?
If a language(L1) is Recursive (REC) and L2 is Recursive (REC) , then what will be L1-L2 ?
If a language(L1) is Recursive (REC) and L2 is Recursive (REC) , then what will be L1-L2 ?
User Avatar
3 votes
3 votes
2 answers
2
Sandeep Verma asked Nov 12, 2017
2,281 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
1 votes
1 votes
2 answers
3
rajesh srivastava asked Jul 15, 2015
1,573 views
intersection of CFL and RL will always be regular or CFL
User Avatar
1 votes
1 votes
0 answers
4
radha gogia asked Nov 1, 2015
425 views
Is it true that if eigen value exists then we will always have a non-zero linearly independent vector ?
For a 3*3 identity matrix , we have eigen value as 1 but there is no linearly independent vector for it since if they are 3 unknowns then we shall have x=y=z=0 so then ho...
User Avatar
Link Copied!