edited by
8,303 views
21 votes
21 votes

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,
edited by

1 Answer

Best answer
40 votes
40 votes

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

edited by
Answer:

Related questions

25 votes
25 votes
5 answers
3
Kathleen asked Sep 12, 2014
4,258 views
The following sequence of operations is performed on a stack:$PUSH (10), PUSH (20), POP, PUSH (10), PUSH (20), POP, POP, POP, PUSH (20), POP$The sequence of values poppe...