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.47K 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. The ________ is used to state a desired effect without stating the exact mechanism of control.

Q. Set A has 3 elements, set B has 6 elements, then the minimum number of elements in A U B is ….

Q. are a different paradigm for computing which draws its inspiration from neuroscience

Q. Which of the following is NOT a type of Microsoft Access database object?

Q. Use cases ________

Q. Which of the following is an example of an unmanaged storage utility set up to do automated backups?

Q. Adaptive system management is

Q. Which of the following can be identified as cloud

Q. Which Design Pattern should you use when an application uses a large number of objects and the storage costs are high because of the sheer quantity of objects.

Q. transaction() does not take the argument