GATE CS 1991 Q03 — Regular and Context-free Languages

A finite language $L$ over a finite alphabet $\Sigma$ contains a finite number of strings, say $L = \{w_1, w_2, \dots, w_k\}$.

We can construct a regular expression for $L$ by taking the union of all its strings:

Since we can always write a regular expression for any finite language, every finite language is a regular language.

According to the Chomsky hierarchy, the language families are nested as follows:

Thus, while statements (B), (C), and (D) are all technically true for a finite language, statement (D) ("It is a regular language") is the strongest (most specific and restrictive) correct statement because the class of regular languages is the smallest family among the options that contains all finite languages.