17 views

We know by Rice's theorem that none of the following problems are decidable. However are they recursively enumerable,or non-RE?

1. Does $L(M)$ contain at least two strings?
2. Is $L(M)$ infinite?
3. Is $L(M)$ a context-free language?
4. Is $L(M) = (L(M))^{R}$?
| 17 views