Which one of the following is the strongest correct statement about a finite…

PYQ GATE 1991

Which one of the following is the strongest correct statement about a finite language over some finite alphabet Σ?

  1. A.

    It could be undecidable

  2. B.

    It is Turing-machine recognizable

  3. C.

    It is a context-sensitive language

  4. D.

    It is a regular language

  5. E.

    None of the above

Attempted by 83 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…