Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q51: A transition table shows ______.
- A: states of a game board
- B: transitions between states
- C: input letters
- D: regular expressions
View Answer
B
Q52: A finite automaton must have at least one ______ state and one or more ______ states.
- A: final, initial
- B: input, transition
- C: transition, input
- D: initial, final
View Answer
D
Q53: The language of strings starting with a and ending with b OR starting with b and ending with a
- A: a+b
- B: (a+b)(a+b)*
- C: a(a+b)*b+b(a+b)*a
- D: a(a+b)*a
View Answer
C
Q54: Which of the following regular expressions represents the language of strings ending in aa?
- A: a+b
- B: (a+b)*aa
- C: ab
- D: (a+b)*
View Answer
B
Q55: What is the purpose of a transition diagram in a finite automaton?
- A: To depict input letters
- B: To show transitions between states
- C: To simplify regular expressions
- D: To represent alphabets
View Answer
B
Q56: If r1 = (aa+bb) and r2 = (a+b), what is the regular language generated by r1r2?
- A: (aa+bb) + (a+b)
- B: (aa+bb)(a+b)
- C: (aaa + aab + bba + bbb)
- D: (ab+ba)(aa+bb)
View Answer
B
Q57: What does r1+r2 represent in terms of languages L1 and L2?
- A: L1 ∪ L2
- B: L1L2
- C: L1 ∩ L2
- D: L1-L2
View Answer
A
Q58: A finite automaton has a finite number of ______.
- A: alphabets
- B: states
- C: transitions
- D: all of the above
View Answer
B
Q59: If a language L contains even thousand words, its regular expression may be expressed by ______.
- A: placing '*' between all words
- B: placing '+' between all words
- C: using Kleene star
- D: using concatenation
View Answer
B
Q60: The transition table of a finite automaton shows how to move from one ______ to another.
- A: alphabet
- B: state
- C: regular expression
- D: input letter
View Answer
B