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 Σ?
- A.
It could be undecidable
- B.
It is Turing-machine recognizable
- C.
It is a context-sensitive language
- D.
It is a regular language
- E.
None of the above
Attempted by 83 students.
Sign up free to check your answer
Sign up freeLoading lesson…

