409 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

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
0 answers
2
Pranavpurkar asked Nov 16, 2022
387 views
Consider the language given below:$L$ $=$ { $p$ $|$ $p$ $\neq$ $w$ $and$ $p$ $is$ $the$ $prefix$ $of$ $w$ $and$ $w$ $\epsilon$ {$0,1$}*}Which of following is true about ...