The Gateway to Computer Science Excellence
+2 votes
49 views
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?
in Theory of Computation by (493 points) | 49 views
+1
You say Language of turing machine is Phi , so complement of it is sigma*.

1 Answer

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.
by Boss (44.1k points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,251 answers
198,045 comments
104,670 users