Answer:
The answer to this question is False.
Explanation:
The answer is false because an Empty language is represented by ∅ (phi).Since all finite languages are regular hence the empty language is also a regular language.A regular language is a language which can be represented by regular expressions it is also called formal language.
