2 Replies - 1363 Views - Last Post: 01 December 2008 - 11:22 AM

#1 reCoded   User is offline

  • D.I.C Regular

Reputation: 6
  • View blog
  • Posts: 282
  • Joined: 25-February 08

Computational Theory

Posted 22 October 2008 - 08:04 PM

Hey guys,

Yeah I am taking this course and have an exam coming up. Anyone know where I can find good examples and explanations of the Pumping Lemma? I know the definition but proving that a language or a palindromes are not regular is a slight problem I am having.

Thanks,
reCoded.
Is This A Good Question/Topic? 0
  • +

Replies To: Computational Theory

#2 homemade-jam   User is offline

  • Gabe's Nemesis
  • member icon

Reputation: 11
  • View blog
  • Posts: 1,300
  • Joined: 17-March 08

Re: Computational Theory

Posted 23 October 2008 - 01:36 AM

I'm sure there is something here.
Was This Post Helpful? 0
  • +
  • -

#3 mostyfriedman   User is offline

  • The Algorithmi
  • member icon

Reputation: 729
  • View blog
  • Posts: 4,473
  • Joined: 24-October 08

Re: Computational Theory

Posted 01 December 2008 - 11:22 AM

there's this book called, the theory of computation by michael sipser..it has pretty explanations of that
Was This Post Helpful? 0
  • +
  • -

Page 1 of 1