Question: Prove language is not regular by using Pumping Lemma. L 1 = { 0 ^ i 1 ^ j 0 ^ k | i <
Prove language is not regular by using Pumping Lemma. Li j k i j or i k
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
