4,303 views

Which of the following is the strongest correct statement about a finite language over some finite alphabet $\Sigma?$

1. It could be undecidable
2. It is Turing-machine recognizable
3. It is a context-sensitive language.
4. It is a regular language.
5. None of the above,

(B), (C) and (D) are true. But the strongest answer would be (D) a regular language. It is trivial to say that a finite set of strings (finite language) can be accepted using a finite set of states. And regular language $\subset$ context-free $\subset$ context-sensitive $\subset$ Turing recognizable, would imply that regular language is the strongest answer.

by

@arjun sir if finite word was not mentioned then a) would be the answer?

talha hashim i too think the same.

how it could be undecidable then  it would not be
@ talha hashim did you get the answer?