The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+9 votes
679 views

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$ ?

  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,
asked in Theory of Computation by Veteran (59.4k points)
edited by | 679 views

1 Answer

+19 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. 

answered by Boss (17.8k points)
edited by
Answer:

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

34,781 questions
41,758 answers
118,936 comments
41,400 users