The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+8 votes
570 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$ ?

(a). It could be undecidable

(b). It is Turing-machine recognizable

(c). It is a context sensitive language.

(d). It is a regular language.

(e). None of the above,
asked in Theory of Computation by Veteran (68.8k points) | 570 views

1 Answer

+17 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 Veteran (14.6k points)
selected by


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

32,544 questions
39,231 answers
109,311 comments
36,613 users