Tools

Identify Regular languages using Pumping lemma

Procedure

1. To Identify Regular languages using pumping lemma , select any example given and follow the instructions provided .

Read the theorem and click on the start button to start the simulation

select from the examples

select any example and follow the instructions provided

select from the examples

Enter the value for pumping length P

select from the examples

Enter a string S that is in the language

select from the examples

decompose the string S into xyz

select from the examples

Enter value of i

select from the examples

The lemma states that we can "pump" the substring y by inserting copies of it "i" times, if all the conditions are satisfied then the string is in the language

select from the examples

if any of the conditions are not satified then string is not in the language you can always find the explanation by clicking on the explanation button

select from the examples