# test series

59 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?
1
You say Language of turing machine is Phi , so complement of it is sigma*.

L = { (M) | M accepts empty language}

$L^c$ = { (M) | M accepts non-empty language}

L is NOT RE, and $L^c$ is RE.

## Related questions

1
211 views
Consider the following statements: $S_1:\{(a^n)^m|n\leq m\geq0\}$ $S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\}$ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language? $4$ $16$ $20$ $24$