Register

self doubt

471 views
0 votes
0 votes
L={ <M> | ‘M’ IS A TURING MACHINE AND ‘M’ COMPUTES THE PRODUCT OF TWO NUMBERS }

here what can we say about ‘L’?
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

0 votes
0 votes
1 answer
2
mrinmoyh asked Dec 27, 2018
319 views
self doubt
L1 $\cap$ L2 = $\phi$ This problem is decidable or undecidable in case of CSL, REL, & REnL ????
L1 $\cap$ L2 = $\phi$ This problem is decidable or undecidable in case of CSL, REL, & REnL ????
User Avatar
2 votes
2 votes
1 answer
3
kumar.dilip asked Dec 13, 2018
477 views
Self Doubt
If L is CFL then $\bar{L}$ is Recursive. ( True/False) If L is CFL then $\bar{L}$ is RE. (True/Flase).
If L is CFL then $\bar{L}$ is Recursive. ( True/False)If L is CFL then $\bar{L}$ is RE. (True/Flase).
User Avatar
0 votes
0 votes
1 answer
4
jatin khachane 1 asked Dec 10, 2018
401 views
Self Doubt
L= { M⟩|L(M) accepts empty string} L={⟨M⟩|TM halts on empty string} Identify RE , REC , Not RE ?? Are this two languages or same I think both are same if TM halts on $\epsilon$ then L(M) accepts $\epsilon$ right ??
L= { M⟩|L(M) accepts empty string} L={⟨M⟩|TM halts on empty string} Identify RE , REC , Not RE ??Are this two languages or sameI think both are same if TM halts on...
User Avatar
Link Copied!