The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+9 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,

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

- All categories
- General Aptitude 1.2k
- Engineering Mathematics 4.9k
- Digital Logic 2k
- Programming & DS 3.6k
- Algorithms 3k
- Theory of Computation 3.9k
- Compiler Design 1.5k
- Databases 2.9k
- CO & Architecture 2.5k
- Computer Networks 2.9k
- Non GATE 949
- Others 1.3k
- Admissions 409
- Exam Queries 419
- Tier 1 Placement Questions 17
- Job Queries 55
- Projects 9

34,781 questions

41,758 answers

118,936 comments

41,400 users