Register

ace test series

138 views
0 votes
0 votes
consider the language

L={(M,w)| w belongs L(M)}

where M is pushdown auntomata then

a)L is regular

b)L is cfl

c) L is csl

d) L is REcursive.

it should be CFL

but answer is Recursive why?
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

1 votes
1 votes
2 answers
1
amrish0524 asked Nov 14, 2023
279 views
Ace Test series
Which of the following Language has Prefix property? A) L=01* B) L=0*1* c) L= {0" 1" | n>, 1} D) L= {WW | We(0+1)*}
Which of the following Language has Prefix property?A) L=01*B) L=0*1*c) L= {0" 1" | n>, 1}D) L= {WW | We(0+1)*}
User Avatar
2 votes
2 votes
1 answer
2
Souvik33 asked Nov 23, 2022
314 views
CFL | TOC | Ace Academy Test Series
If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE
If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE
User Avatar
0 votes
0 votes
0 answers
4
Crackca asked Jan 5, 2022
275 views
ToC Test series doubt(ACE)
I am getting A,C and D but the answer given is A,C.
I am getting A,C and D but the answer given is A,C.
User Avatar
Link Copied!