Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q321: Fill in the blank: The language {an bn : n=0,1,2,3,…} is _______.
- A: Regular
- B: Nonregular
- C: Finite
- D: Empty
View Answer
B
Q322: How can an FA accepting the intersection of two regular languages be constructed?
- A: By combining states of both FAs
- B: By creating a new FA with transitions from both FAs
- C: By building an FA with final states from both FAs
- D: By converting and reducing previous FAs
View Answer
A
Q323: Fill in the blank: The language {an bn} is proven to be nonregular by showing that the FA must have _______.
- A: An infinite number of states
- B: A looping circuit
- C: A finite number of states
- D: No loops
View Answer
B
Q324: What is the correct regular expression for the language L1 ∩ L2 in the given example?
- A: (b+abbab)a(a+bbaaba)(b+aba)
- B: (a+b)aa(a+b)
- C: (b+aba)
- D: (a+b)a(a+b)
View Answer
A
Q325: Fill in the blank: An FA corresponding to the intersection of two regular languages has an initial state corresponding to the _______.
- A: Initial state of both FAs
- B: Final state of both FAs
- C: Any state of the FAs
- D: State with the most transitions
View Answer
A
Q326: What is the result of (L1 ∪ L2)c where L1 and L2 are regular languages?
- A: L1c ∩ L2c
- B: L1 ∪ L2c
- C: L1c ∪ L2
- D: L1 ∩ L2
View Answer
A
Q327: Fill in the blank: To prove a language is nonregular, one method is to show that the corresponding FA must have a _______.
- A: Looping circuit
- B: Finite number of states
- C: Regular expression
- D: Deterministic transitions
View Answer
A
Q328: What does the Pumping Lemma state about an infinite regular language?
- A: There exist three strings x, y, and z such that xynz are words in L
- B: There exist two strings x and y such that xy are words in L
- C: There is a finite number of states in the FA
- D: for every word w, there is a finite number of decompositions
View Answer
A
Q329: What is a nonregular language?
- A: A language that can be expressed by a regular expression
- B: A language that cannot be expressed by any regular expression
- C: A language that is finite
- D: A language with a finite number of states
View Answer
B
Q330: Which of the following languages is considered nonregular?
- A: {an bn : n=0,1,2,3,…}
- B: {a, b, c}
- C: {aa, bb}
- D: {a, b}
View Answer
A