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

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,

+20 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.4k
- Engineering Mathematics 5.7k
- Digital Logic 2.2k
- Programming & DS 4.1k
- Algorithms 3.6k
- Theory of Computation 4.5k
- Compiler Design 1.7k
- Databases 3.2k
- CO & Architecture 2.8k
- Computer Networks 3.2k
- Non GATE 1.1k
- Others 1.5k
- Admissions 503
- Exam Queries 474
- Tier 1 Placement Questions 22
- Job Queries 61
- Projects 13

39,782 questions

46,784 answers

140,761 comments

58,697 users