462 views
2 votes
2 votes
  1. If L is CFL then $\bar{L}$ is Recursive. ( True/False)
  2. If L is CFL then $\bar{L}$ is RE. (True/Flase).

1 Answer

Related questions

0 votes
0 votes
1 answer
2
mrinmoyh asked Dec 27, 2018
291 views
L1 $\cap$ L2 = $\phi$ This problem is decidable or undecidable in case of CSL, REL, & REnL ????
0 votes
0 votes
0 answers
3
newdreamz a1-z0 asked Dec 22, 2018
453 views
L={ <M | ‘M’ IS A TURING MACHINE AND ‘M’ COMPUTES THE PRODUCT OF TWO NUMBERS }here what can we say about ‘L’?
0 votes
0 votes
1 answer
4
jatin khachane 1 asked Dec 10, 2018
387 views
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...