#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

If L is recursively enumerable then ________________.

Answer

L may not be recursively enumerable