Arrange the following in the order of execution while proving a Language is…

2026

Arrange the following in the order of execution while proving a Language is non-Regular using Pumping Lemma.

A. Split in to xyz satisfying pumping Lemma conditions.

B. Assume the language is regular.

C. Choose a string of length ≥ pumping length.

D. Show contradiction when pumping y.

Choose the correct answer from the options given below:

  1. B, C, D, A

  2. C, D, A, B

  3. B, C, A, D

  4. A, B, C, D

  1. A.

    1

  2. B.

    2

  3. C.

    3

  4. D.

    4

Attempted by 38 students.

Show answer & explanation

Correct answer: C

To prove a language is non-Regular using the Pumping Lemma, follow these steps in order:

1. Assume the language is regular (Step B).

2. Choose a string of length greater than or equal to the pumping length (Step C).

3. Split the string into xyz satisfying Pumping Lemma conditions (Step A).

4. Show contradiction when pumping y (Step D).

The correct order is B, C, A, D.

Explore the full course: Mppsc Assistant Professor