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

Recursive : TM that always halt = ________________ : TM that may or may not halt

Answer

recursively enumerable