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

The Gateway to Computer Science Excellence

+13 votes

Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:

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,

+26 votes

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.

52,345 questions

60,497 answers

201,862 comments

95,319 users