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

4,303 views

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

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

## 1 Answer

Best answer

(**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.