Question: Using pumping lemma to show that the language L={o^i 1^j | i>j} is not regular. Use pumping down and proof by contradiction.

Using pumping lemma to show that the language L={o^i 1^j | i>j} is not regular.

Use "pumping down" and proof by contradiction.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!