Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q331: If L1 and L2 are regular languages, what can be said about L1 ∩ L2?
- A: It is always nonregular
- B: It is also regular
- C: It is always infinite
- D: It is finite
View Answer
B
Q332: According to the example given, why does the FA accept words not in L?
- A: Because it has an infinite number of states
- B: Because it contains circuits that lead to invalid words
- C: Because the language L is regular
- D: Because L is finite
View Answer
B
Q333: Which theorem is used to prove that a language is nonregular by showing that it cannot be expressed by any FA?
- A: Theorem of Finite Automata
- B: Pumping Lemma
- C: Kleene's Theorem
- D: DeMorgan's Law
View Answer
B
Q334: For the language L = {Λ, ab, aabb, aaabbb, …}, which method is used to show it is nonregular?
- A: Building a corresponding FA
- B: Using the Pumping Lemma
- C: Constructing a regular expression
- D: Determining its finite states
View Answer
B
Q335: In the proof of the Pumping Lemma, what does the string y represent?
- A: A string that is null
- B: An empty string
- C: A string that generates a circuit
- D: A string that generates the path from the start state to a revisited state
View Answer
C
Q336: What example is used to illustrate the Pumping Lemma with a FA having 5 states?
- A: The language {an bn : n=0,1,2,3,…}
- B: The language EQUAL
- C: The language PALINDROME
- D: The language {a, b, c}
View Answer
A
Q337: The language EQUAL consists of strings with what property?
- A: Number of a’s equal to number of b’s
- B: Number of a’s less than number of b’s
- C: Number of a’s greater than number of b’s
- D: Any number of a’s and b’s
View Answer
A
Q338: The Pumping Lemma can be applied to which type of language to prove it is regular?
- A: Regular languages
- B: Nonregular languages
- C: Finite languages
- D: Infinite languages
View Answer
A
Q339: What does the Pumping Lemma version II state about an infinite language?
- A: For all words w in L of length more than N, there are strings x, y, and z with length(x) + length(y) ≤ N such that w = xyz and all xynz are in L
- B: For all words w in L, there exist three strings x, y, and z where y can be null
- C: string xynz is not necessarily in L
- D: All words of length more than N are accepted by an FA
View Answer
B
Q340: In the example given, why does the language PALINDROME not satisfy Pumping Lemma version II?
- A: The word w can be decomposed such that xyyz is not in PALINDROME
- B: The word w is too short to apply Pumping Lemma
- C: version I was incorrectly applied
- D: Pumping Lemma version II does not apply to any language
View Answer
A