0 votes

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

- Does $L(M)$ contain at least two strings?
- Is $L(M)$ infinite?
- Is $L(M)$ a context-free language?
- Is $L(M) = (L(M))^{R}$?

0 votes

Found the solutions here https://www.classes.cs.uchicago.edu/archive/2010/spring/28100-1/hw4SOL