514 views

1 Answer

0 votes
0 votes
Option c.

The type of M is not provided, if it was a FA/PDA then it would have been decidable but if it was a TM then it would be undecidable. So as M is not provided we can’t predict the behavior.

Related questions

0 votes
0 votes
0 answers
1
Rajender gill asked Dec 21, 2022
508 views
Consider the following language:L = {< M | L(M) has atleast 10 strings}Which of the following is true about L?A.L is decidableB.L is Turing recognizableC.L is not recurs...
17 votes
17 votes
4 answers
4
gatecse asked Aug 20, 2014
5,785 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