Scribd Logo
Upload

Welcome to Scribd!

  • 37 views

    Pumping PDF

    Uploaded by

    Amit Kumar
    The document discusses using the Pumping Lemma to prove that a language is not regular. It provides an overview of the Pumping Lemma and the steps to prove a language is not regular by contradiction. It then gives two example proofs: (1) the language of strings with equal numbers of 0s and 1s, and (2) the language of strings with a number of 10s that is greater than or equal to the number of 1s. Both examples follow the steps of assuming regularity, applying the Pumping Lemma, choosing a string, and obtaining a contradiction.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Pumping PDF

    Uploaded by

    Amit Kumar
    37 views3 pages
    The document discusses using the Pumping Lemma to prove that a language is not regular. It provides an overview of the Pumping Lemma and the steps to prove a language is not regular by contradiction. It then gives two example proofs: (1) the language of strings with equal numbers of 0s and 1s, and (2) the language of strings with a number of 10s that is greater than or equal to the number of 1s. Both examples follow the steps of assuming regularity, applying the Pumping Lemma, choosing a string, and obtaining a contradiction.

    Original Title

    pumping.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses using the Pumping Lemma to prove that a language is not regular. It provides an overview of the Pumping Lemma and the steps to prove a language is not regular by contradiction. It then gives two example proofs: (1) the language of strings with equal numbers of 0s and 1s, and (2) the language of strings with a number of 10s that is greater than or equal to the number of 1s. Both examples follow the steps of assuming regularity, applying the Pumping Lemma, choosing a string, and obtaining a contradiction.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    37 views3 pages

    Pumping PDF

    Uploaded by

    Amit Kumar
    The document discusses using the Pumping Lemma to prove that a language is not regular. It provides an overview of the Pumping Lemma and the steps to prove a language is not regular by contradiction. It then gives two example proofs: (1) the language of strings with equal numbers of 0s and 1s, and (2) the language of strings with a number of 10s that is greater than or equal to the number of 1s. Both examples follow the steps of assuming regularity, applying the Pumping Lemma, choosing a string, and obtaining a contradiction.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    CSC B36 Additional Notes

    proving languages not regular using Pumping Lemma


    c Nick Cheng

    ⋆ Introduction
    The Pumping Lemma is used for proving that a language is not regular. Here is the Pumping Lemma.

    If L is a regular language, then there is an integer n > 0 with the property that:
    (*) for any string x ∈ L where |x| ≥ n, there are strings u, v, w such that
    (i) x = uvw,
    (ii) v 6= ǫ,
    (iii) |uv| ≤ n,
    (iv) uv k w ∈ L for all k ∈ N.
    To prove that a language L is not regular, we use proof by contradiction. Here are the steps.

    1. Suppose that L is regular.

    2. Since L is regular, we apply the Pumping Lemma and assert the existence of a number n > 0 that
    satisfies the property (*).

    3. Give a particular string x such that

    (a) x ∈ L,
    (b) |x| ≥ n.

    This the trickiest part. A wrong choice here will make step 4 impossible.

    4. By Pumping Lemma, there are strings u, v, w such that (i)-(iv) hold. Pick a particular number k ∈ N
    and argue that uv k w 6∈ L, thus yielding our desired contradiction.

    What follows are two example proofs using Pumping Lemma.

    CSC B36 proving languages not regular using Pumping Lemma Page 1 of 3
    ⋆ A (relatively) easy example
    Let L = {0k 1k : k ∈ N}. We prove that L is not regular.

    [step 1]
    By way of contradiction, suppose L is regular.

    [step 2]
    Let n be as in the Pumping Lemma.

    [step 3]
    Let x = 0n 1n .
    Then x ∈ L [definition of L]
    and |x| = 2n ≥ n.

    [step 4]
    By Pumping Lemma, there are strings u, v, w such that
    (i) x = uvw,
    (ii) v 6= ǫ,
    (iii) |uv| ≤ n,
    (iv) uv k w ∈ L for all k ∈ N.
    Let y be the prefix of x with length n. I.e., y is the first n symbols of x.
    By our choice of x, y = 0n .
    By (i) and (iii), uv = 0j for some j ∈ N with 0 ≤ j ≤ n.
    Combining with (ii), v = 0j for some j ∈ N with 0 < j ≤ n.
    By (iv), uv 2 w ∈ L. (#)
    Aside: We are picking k = 2. Indeed, any k 6= 1 will do here.

    However, uv 2 w = uvvw
    = 0n+j 1n
    6∈ L, [definition of L; since j > 0, n + j 6= n]
    which contradicts (#).

    Therefore L is not regular. 

    CSC B36 proving languages not regular using Pumping Lemma Page 2 of 3
    ⋆ A harder example
    Let L = {(10)p 1q : p, q ∈ N, p ≥ q}. We prove that L is not regular.

    [step 1]
    By way of contradiction, suppose L is regular.

    [step 2]
    Let n be as in the Pumping Lemma.

    [step 3]
    Let x = (10)n 1n .
    Then x ∈ L [definition of L]
    and |x| = 3n ≥ n.

    [step 4]
    By Pumping Lemma, there are strings u, v, w such that
    (i) x = uvw,
    (ii) v 6= ǫ,
    (iii) |uv| ≤ n,
    (iv) uv k w ∈ L for all k ∈ N.
    Let y be the prefix of x with length n.
    n n−1
    By our choice of x, y = (10) 2 if n is even, and y = (10) 2 1 if n is odd.
    By (i) and (iii), uv is a prefix of y, and
    uv = (10)j for some j ∈ N with 0 ≤ j ≤ n2 , or
    uv = (10)j 1 for some j ∈ N with 0 ≤ j < n2 .
    Combining with (ii) — depending on whether |uv| is even or odd,
    v is some nonempty substring of (10)j for some j where 0 ≤ j ≤ n2 , or
    v is some nonempty substring of (10)j 1 for some j where 0 ≤ j < n2 .

    There are 3 cases to consider:


    (a) v starts with 0 and ends with 0.
    (b) v starts with 1 and ends with 1.
    (c) v starts and ends with different symbols.

    For case (a), uv 0 w = uw contains 110 as a substring.


    Thus uv 0 w 6∈ L, [110 is not a substring of any string in L] which contradicts (iv).

    Similarly for case (b), uv 0 w contains 00 as a substring. [details left to reader]

    For case (c), v = (10)i or v = (01)i , where 0 < i.


    So |v| = 2i.
    Thus uv 0 w = uw = (10)n−i 1n 6∈ L, [definition of L; n − i < n]
    which contradicts (iv).

    We reach a contradiction in all cases.

    Therefore L is not regular. 

    CSC B36 proving languages not regular using Pumping Lemma Page 3 of 3

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy