0 votes 0 votes In pumping lemma it says if there is a string whose length is >=N,where N is number of states in dfa,then language of machine is infinite,but there is one upper constraing also. 2N-1>=|W|>=N Can anyone tell me about the use of 2N-1 here ? Theory of Computation theory-of-computation pumping-lemma pumping lemma + – rahul sharma 5 asked Jan 11, 2017 rahul sharma 5 513 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Hradesh patel commented Jan 11, 2017 reply Follow Share i think its CNFform whose length is (2N-1) 0 votes 0 votes rahul sharma 5 commented Jan 11, 2017 reply Follow Share I have added the actual question related to this https://gateoverflow.in/104084/toc-finite-automata 0 votes 0 votes Please log in or register to add a comment.