edited by
457 views
0 votes
0 votes
Consider the following language:

L = {< M > | L(M) has atleast 10 strings}

Which of the following is true about L?

A.L is decidable

B.L is Turing recognizable

C.L is not recursive

D.None of these
edited by

Please log in or register to answer this question.

Answer:

Related questions

0 votes
0 votes
1 answer
1
Rajender gill asked Dec 21, 2022
496 views
Consider the following language:L = {<M>|M halts after 200 steps for all inputs}Which of the following is True about L?A.L is decidableB.L is undecidableC.Cannot be predi...
17 votes
17 votes
4 answers
4
gatecse asked Aug 20, 2014
5,640 views
$L= \{\langle M\rangle \mid L(M)\text{ is infinite}\}$$L$ is RE but $L'$ is not REBoth $L$ and $L'$ are RE$L$ is not RE but $L'$ is REBoth $L$ and $L'$ are not RE