My Computer Forum Computer Science Forum

Go Back   My Computer Forum > Computer Science Forum > Theory of Computation

Theory of Computation Theoretical Computer Science - Automata Theory, Computability Theory, and Computational Complexity Theory


Reply
 
LinkBack Thread Tools Display Modes
January 26th, 2010, 11:56 PM   #1
 
Joined: Jan 2010
Posts: 1
Pumping lemma

I have some problem that dealt with pumping lemma which using the pigeonhole principle.
for a regular language , if we can a n length of a string which means we also have n+1 states of sequence .
if i am about to describe it by using the pigeonhole principle , which 1 should i refer ..? pigeons as the length of string or pigeons as the number of state's sequence ?
R3.RyozKidz is offline  
 

My Computer Forum is free to register and we welcome everyone!

Reply

  My Computer Forum > Computer Science Forum > Theory of Computation

Tags
lemma, pumping



Thread Tools
Display Modes






Copyright © 2018 My Computer Forum Forum. All rights reserved.