1.
Let L be an infinite language accepted by a finite automaton with N states, then for all words W in L that have length more than N there are strings x,y and Z (y being non null string) and length(x)+length(y)≤N s.t. W=xyz and all strings of the form xy^n z are in L for n=1,2,3………..
- ATrue
- BFalse
This is pumping lemma version II.