Scribd Logo
Upload

Welcome to Scribd!

  • 33 views

    Class 6

    Uploaded by

    api-20012397
    The document discusses non-regular languages and how to prove that a language is not regular using the pumping lemma. It provides examples of regular and non-regular languages. It also explains the pumping lemma, which states that for any regular language L and string w in L of length greater than the number of states in the corresponding automaton, w can be decomposed into sections x, y, z such that xyiz is in L for all i. It then uses the pumping lemma to prove that the language of strings with an equal number of a's and b's is not regular.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd

    Class 6

    Uploaded by

    api-20012397
    33 views39 pages
    The document discusses non-regular languages and how to prove that a language is not regular using the pumping lemma. It provides examples of regular and non-regular languages. It also explains the pumping lemma, which states that for any regular language L and string w in L of length greater than the number of states in the corresponding automaton, w can be decomposed into sections x, y, z such that xyiz is in L for all i. It then uses the pumping lemma to prove that the language of strings with an equal number of a's and b's is not regular.

    Original Title

    class6

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses non-regular languages and how to prove that a language is not regular using the pumping lemma. It provides examples of regular and non-regular languages. It also explains the pumping lemma, which states that for any regular language L and string w in L of length greater than the number of states in the corresponding automaton, w can be decomposed into sections x, y, z such that xyiz is in L for all i. It then uses the pumping lemma to prove that the language of strings with an equal number of a's and b's is not regular.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    33 views39 pages

    Class 6

    Uploaded by

    api-20012397
    The document discusses non-regular languages and how to prove that a language is not regular using the pumping lemma. It provides examples of regular and non-regular languages. It also explains the pumping lemma, which states that for any regular language L and string w in L of length greater than the number of states in the corresponding automaton, w can be decomposed into sections x, y, z such that xyiz is in L for all i. It then uses the pumping lemma to prove that the language of strings with an equal number of a's and b's is not regular.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 39

    Non-regular languages

    1
    n n
    {a b : n ≥ 0}
    Non-regular languages
    R
    {vv : v ∈ {a, b}*}

    Regular languages
    a *b b*c + a
    b + c ( a + b) *
    etc...
    2
    How can we prove that a language L
    is not regular?

    Prove that there is no DFA that accepts L

    Problem: this is not easy to prove

    Solution: the Pumping Lemma !!!

    3
    The Pigeonhole Principle

    4
    4 pigeons

    3 pigeonholes

    5
    A pigeonhole must
    contain at least two pigeons

    6
    n pigeons

    ...........

    m pigeonholes n>m

    ...........

    7
    The Pigeonhole Principle

    n pigeons

    m pigeonholes
    There is a pigeonhole
    n>m with at least 2 pigeons

    ...........

    8
    The Pigeonhole Principle

    and

    DFAs

    9
    DFA with 4 states

    b
    b b

    a b b
    q1 q2 q3 q4
    a a
    10
    In walks of strings: a no state
    aa is repeated

    aab

    b
    b b

    a a b
    q1 q2 q3 q4
    a a
    11
    In walks of strings: aabb a state
    bbaa is repeated

    abbabb
    abbbabbabb...
    b
    b b

    a a b
    q1 q2 q3 q4
    a a
    12
    If string w has length | w | ≥ 4:
    Then the transitions of string w
    are more than the states of the DFA

    Thus, a state must be repeated


    b
    b b

    a a b
    q1 q2 q3 q4
    a a
    13
    In general, for any DFA:

    String w has length ≥ number of states

    A state q must be repeated in the walk of w

    walk of w
    ...... q ......
    Repeated state 14
    In other words for a string w:

    a transitions are pigeons

    q states are pigeonholes

    walk of w
    ...... q ......
    Repeated state
    15
    The Pumping Lemma

    16
    Take an infinite regular language L

    There exists a DFA that accepts L

    m
    states

    17
    Take string w with w∈ L

    There is a walk with label w:

    .........
    walk w
    18
    If string w has length | w| ≥ m (number
    of states
    of DFA)

    then, from the pigeonhole principle:

    a state is repeated in the walk w

    ...... q ......
    walk w
    19
    Let q be the first state repeated in the
    walk of w

    ...... q ......
    walk w
    20
    Write w= x y z

    ...... q ......

    x z 21
    Observations: length | x y | ≤ m number
    of states
    length | y | ≥1 of DFA

    ...... q ......

    x z 22
    Observation: The string xz
    is accepted

    ...... q ......

    x z 23
    Observation: The string xyyz
    is accepted

    ...... q ......

    x z 24
    Observation: The string xyyyz
    is accepted

    ...... q ......

    x z 25
    i
    In General: The string xy z
    is accepted i = 0, 1, 2, ...

    ...... q ......

    x z 26
    In General: i
    xy z ∈ L i = 0, 1, 2, ...

    Language accepted by the DFA

    ...... q ......

    x z 27
    In other words, we described:

    The Pumping Lemma !!!

    28
    The Pumping Lemma:
    • Given a infinite regular language L
    • there exists an integer m

    • for any string w∈ L with length | w|≥ m

    • we can write w= x y z

    • with | x y | ≤ m and | y | ≥ 1
    i i = 0, 1, 2, ...
    • such that: xy z ∈ L
    29
    Applications

    of

    the Pumping Lemma

    30
    n n
    Theorem: The language L = {a b : n ≥ 0}

    is not regular

    Proof: Use the Pumping Lemma

    31
    n n
    L = {a b : n ≥ 0}

    Assume for contradiction


    that L is a regular language

    Since L is infinite
    we can apply the Pumping Lemma

    32
    n n
    L = {a b : n ≥ 0}

    Let m be the integer in the Pumping Lemma

    Pick a string w such that: w∈ L


    length | w|≥ m

    m m
    We pick w=a b
    33
    m m
    Write: a b =xyz

    From the Pumping Lemma


    it must be that length | x y | ≤ m, | y |≥ 1
    m m
    m m
    xyz = a b = a...aa...aa...ab...b
    x y z
    k
    Thus: y = a , k ≥1
    34
    m m k
    x y z=a b y = a , k ≥1

    i
    From the Pumping Lemma: xy z ∈ L
    i = 0, 1, 2, ...

    2
    Thus: xy z ∈ L

    35
    m m k
    x y z=a b y = a , k ≥1

    2
    From the Pumping Lemma: xy z ∈ L

    m+k m
    2
    xy z = a...aa...aa...aa...ab...b ∈ L
    x y y z

    m+ k m
    Thus: a b ∈L
    36
    m+ k m k≥ 1
    a b ∈L

    n n
    BUT: L = {a b : n ≥ 0}

    m+ k m
    a b ∉L

    CONTRADICTION!!!
    37
    Therefore: Our assumption that L
    is a regular language is not true

    Conclusion: L is not a regular language

    38
    n n
    Non-regular languages {a b : n ≥ 0}

    Regular languages

    39

    You might also like