2 votes 2 votes consider a tùring mchine which accepts the empty language i.e TM = { (M) | M accepts empty language} the complement of the language that is generated by Turing machine is? Theory of Computation theory-of-computation + – aaru14 asked Sep 28, 2017 aaru14 248 views answer comment Share Follow See 1 comment See all 1 1 comment reply Prashant. commented Sep 28, 2017 reply Follow Share You say Language of turing machine is Phi , so complement of it is sigma*. 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes L = { (M) | M accepts empty language} $L^c$ = { (M) | M accepts non-empty language} L is NOT RE, and $L^c$ is RE. Manu Thakur answered Sep 28, 2017 Manu Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.