Question: Q 5 . Answer one question - either Q 5 a or Q 5 D . Q 5 a ) Using Pigeonhole Principle, prove that
Q Answer one question either Qa or QD
Qa Using Pigeonhole Principle, prove that following language is not regular lanquage. is a binary string with equal number of and
OR
QSb Using Pumping Lemma, prove that following language is not regular language. i is a perfect square is not regular
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
