Paper Tayyari

Lecture 27: Pumping Lemma version II

MCQs, short and long questions from lecture 27.Lecture 27 ki MCQs, short aur long sawal.

1 MCQ · 1 MCQ from past papers1 MCQ · 1 MCQ past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/1
– correctsahi
1.
★ Final term past paper

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………..

  1. ATrue
  2. BFalse

This is pumping lemma version II.