Results 1 to 2 of 2

Math Help - Pumping Lemma Problem

  1. #1
    Newbie
    Joined
    Apr 2013
    From
    India
    Posts
    1

    Pumping Lemma Problem

    Hi Guys, I am not sure if this is the right place to post this, so I am sorry if I did just disobey any forum rules.

    The Problem is to show that=>

    a^(n!) for all n>1 is not Regular. Using Pumping lemma. Can anyone please help me be get started?

    If n be the Number of States, then if we take w= a^(n!) , Then|w|=n!>=n. Thats ok but How do I now Split w into x,y,z?

    Thank you in Advance
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Joined
    Oct 2009
    Posts
    5,536
    Thanks
    778

    Re: Pumping Lemma Problem

    Suppose an! = xyz such that |y| ≥ 1 and xyiz is in the language for all i. Then n! < |xy2z| ≤ 2n! < (n + 1)! for n > 1.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Pumping Lemma
    Posted in the Advanced Math Topics Forum
    Replies: 1
    Last Post: September 23rd 2012, 01:26 PM
  2. Pumping Lemma
    Posted in the Advanced Math Topics Forum
    Replies: 0
    Last Post: October 25th 2010, 08:52 AM
  3. Pumping Lemma
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: May 7th 2010, 12:46 AM
  4. Pumping Lemma proof...
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: March 15th 2010, 07:50 AM
  5. Pumping Lemma
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: April 28th 2009, 12:41 PM

Search Tags


/mathhelpforum @mathhelpforum