1.

Which kind of proof is used to prove the regularity of a language?(a) Proof by contradiction(b) Direct proof(c) Proof by induction(d) None of the mentionedThis question was posed to me in an internship interview.Origin of the question is Applications of Pumping Lemma/Pigeonhole principle in section Properties of Regular Languages of Automata Theory

Answer»

Correct OPTION is (a) PROOF by contradiction

For explanation: We use the method of proof by contradiction in pumping lemma to PROVE that a LANGUAGE is REGULAR or not.



Discussion

No Comment Found

Related InterviewSolutions