Register

ACE-TestSeries:TOC-which type of language

652 views

1 Answer

Best answer
4 votes
4 votes
(B) CSL but not CFL.

Since a PDA can never check if the length is prime or not.
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
AJAY KUMAR ARYAN asked Jan 31, 2016
1,178 views
which type of language(regular,CFL,CSL,REC,RE) is generated by this?
L={ ambn|m <=2n+5}
L={ ambn|m <=2n+5}
User Avatar
3 votes
3 votes
2 answers
2
Sambit Kumar asked Mar 15, 2018
763 views
what type of language
{$<M>\mid M$ is a $TM$ that doesn't accept any even number} what type of language is it? Recursively enumerable Recursive Not recursively enumerable none of the above
{$<M>\mid M$ is a $TM$ that doesn't accept any even number}what type of language is it?Recursively enumerableRecursiveNot recursively enumerablenone of the above
User Avatar
0 votes
0 votes
0 answers
3
Chhotu asked Jan 31, 2018
310 views
Type of Language
Hi Guys, What is the type of $L_{1}$ and $L_{2}$ ? If they are REC then How could it be proved ?
Hi Guys, What is the type of $L_{1}$ and $L_{2}$ ? If they are REC then How could it be proved ?
User Avatar
Link Copied!