Register

is every recusrive is csl ?

340 views
0 votes
0 votes
i know every csl is recursive while viceversa is true?
User Avatar

1 Answer

0 votes
0 votes
No.

Just like every CFL is Regular BUT not every regular language is CFL.

Csl is a strict subset of recursive which in turn is a strict subset of Recursivly enumerable.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
commenter commenter asked Jun 13, 2019
358 views
Is each and every NP complete problem (polynomially) reduced to each and every another NP complete problem?
I know that all NP problems can be reduced to Boolean Satisfiability SAT problem. But my question is whether SAT problem can be reduced to other NP complete problems like...
User Avatar
1 votes
1 votes
0 answers
2
sumit goyal 1 asked Jan 1, 2018
755 views
set of all strings in which every zero is followed by atleast 2 one . language is
L = { 011 ,0111 ,0111111 ,......... , 1011 ,101111 ,} is this language then why R.E = (1+ 011)*
L = { 011 ,0111 ,0111111 ,......... , 1011 ,101111 ,} is this language then why R.E = (1+ 011)*
User Avatar
2 votes
2 votes
0 answers
4
h4kr asked Dec 23, 2022
287 views
Is it CFL or CSL?
Is {$a^nb^nc^n$ | $n>=0$} CSL? After comparing both a and b, stack would be empty. So it can’t be CFL. So it is CSL or recursive. And does this language require more than 1 stack? Please tell how would check for the grammer of this language even if it is in CSL. Thank you
Is {$a^nb^nc^n$ | $n>=0$} CSL? After comparing both a and b, stack would be empty. So it can’t be CFL. So it is CSL or recursive. And does this language require more th...
User Avatar
Link Copied!