Theory of Computation Regular Languages and Finite Automata Regular Languages

Which of the following is/are FALSE regarding pumping lemma for regular languages?

1
Satisfying pumping lemma is a necessary condition for language to be regular
2
Satisfying pumping lemma is a sufficient condition for language to be regular
3
Not Satisfying pumping lemma is a necessary condition for language to be regular
4
Not Satisfying pumping lemma is a sufficient condition for language to be not regular

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters