274 views
0 votes
0 votes
Consider the following equation:

 

L1:{TM IT M accepts Є}

 

L2:{TM IT M accepts only Є}

 

Which of the following is not semidecidable?

 

SELECT ONE OPTION

 

A L1 only

B L2 only

C Both L1 and L2

D none of the above

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
anupamsworld asked Sep 1, 2022
273 views
Construct PDA using empty stack method for the given language.$L=\left \{ x \space\ | \space\ x\in \left \{ a,b \right \}^{*} ; n_{a}(x) >= n_{b}(x) \right \}$//number of...
0 votes
0 votes
2 answers
2
anupamsworld asked Aug 29, 2022
627 views
Which of the following is/are Regular?A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$B] $\left \{ WXW^{R}Y \space\ | \space\ W,X,Y...
0 votes
0 votes
1 answer
3
Rajender gill asked Jan 11, 2023
274 views
L={ a^x b^y | x≠y AND x≠2y } Is This CFL? If Yes Than How
0 votes
0 votes
1 answer
4
Rajender gill asked Dec 21, 2022
288 views
Consider the language given below:L={P!=w | P is prefix of w and w <-{0,1}*}Which is TRUE about L?A.L is CFLB.L is DCFLC.L is CSL CORRECT ANSWERD.L is regular