Couple of quick theory of computation questions

Discussion in 'OT Technology' started by mrburner, Feb 15, 2004.

  1. mrburner

    mrburner Ron Paul 2008

    Joined:
    May 9, 2001
    Messages:
    7,448
    Likes Received:
    0
    Location:
    Phoenix
    just a couple things i could use explanations for...looking over some review sheets for an upcoming test

    all regular languages can be pumped..so why can't the pumping lemma be used to show that a language is regular?

    also can someone maybe explain something about a grammar, and how to construct an unambiguous grammar...i can give you specific examples if you need the help to explain

    thanks
     
  2. tailgate

    tailgate Whats with today, today?

    Joined:
    May 4, 2001
    Messages:
    274
    Likes Received:
    0
    Location:
    Texas
    Sorry, its been too long since Ive taken Automata Theory, good luck though
     
  3. mrburner

    mrburner Ron Paul 2008

    Joined:
    May 9, 2001
    Messages:
    7,448
    Likes Received:
    0
    Location:
    Phoenix
    bump, anyone? test is tomorrow
     

Share This Page