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

What kind of languages does a TM decide?

Answer

recursively enumerable