1.

Complete the following statement:Statement : A language is turing recognizable if an only if ___________a) an enumerator enumerates itb) it is finitec) both (

A. an enumerator enumerates itb) it is finitec) both (a) and (
B. it is finite
C. both (a) and (b)
D. none of the mentioned
Answer» B. it is finite


Discussion

No Comment Found

Related MCQs