248 views
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?

1 Answer

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.

No related questions found