Let L be any infinite regular language, defined over an alphabet Σ then there exist three strings x, y and z belonging to Σ such that all the strings of the form XY^ n Z for n=1,2,3, … are the words in L called

Home / Engineering / Theory of Computation / Question

Mr. Dubey • 51.43K Points
Coach

Q.) Let L be any infinite regular language, defined over an alphabet Σ then there exist three strings x, y and z belonging to Σ such that all the strings of the form XY^ n Z for n=1,2,3, … are the words in L called

(A) Complement of L

(B) Pumping Lemma

(D) None in given

Correct answer : Option (B) - Pumping Lemma

Discusssion

Related MCQs on Theory of Computation

Q. Kruskal’s algorithm can efficiently implemented using the disjoint-set data structure.

Q. The alias should have

Q. Voronoi diagram

Q. Find the name of those cities with temperature and condition whose condition is either sunny or cloudy but temperature must be greater than 70.

Q. The most simple and popular method of measuring economic development is to calculate the trend of gross national product (GNP) at __________

Q. Which of the following is false?

Q. This unsupervised clustering algorithm terminates when mean values computed for the current iteration of the algorithm are identical to the computed mean values for the previous iteration.

Q. If A and B are the inputs of a half adder, the sum is given by

Q. Choose THREE (3) senses in Multi-modal Technology i. Touch ii. Smell iii. Sound iv. Instinct

Q. The system acctcom accounting program