MCQ
Q.
Which of the following can refer a language to be non regular?
Correct Answer: C
On the contrary, the typical way to prove that a language is to construct either a finite state machine or a regular expression for the language.