gs gs101 Properties of Regular Languages - Pumping Lemma for Regular Language - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Properties of Regular Languages. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: Relate the following statement:
Statement: All sufficiently long words in a regular language can have a middle section of words repeated a number of times to produce a new word which also lies within the same language.
Statement: All sufficiently long words in a regular language can have a middle section of words repeated a number of times to produce a new word which also lies within the same language.
Turing Machine
Pumping Lemma
Arden’s theorem
None of the mentioned
Question 4: Let w= xyz and y refers to the middle portion and |y|>0.What do we call the process of repeating y 0 or more times before checking that they still belong to the language L or not?
Generating
Pumping
Producing
None of the mentioned
Question 8: If d is a final state, which of the following is correct according to the given diagram?
x=p, y=qr, z=s
x=p, z=qrs
x=pr, y=r, z=s
All of the mentioned
Question 9: Let w be a string and fragmented by three variable x, y, and z as per pumping lemma. What does these variables represent?
string count
string
string count and string
none of the mentioned
Question 10: Which of the following one can relate to the given statement:
Statement: If n items are put into m containers, with n>m, then atleast one container must contain more than one item.
Statement: If n items are put into m containers, with n>m, then atleast one container must contain more than one item.
Pumping lemma
Pigeon Hole principle
Count principle
None of the mentioned
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
