Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q41: What is the regular expression for the EVEN-EVEN language?
- A: a+b
- B: (aa+bb+(ab+ba)(aa+bb)(ab+ba))
- C: ab
- D: (a+b)*
View Answer
B
Q42: Which regular expression does NOT generate any string of concatenation of a and b?
- A: ab
- B: (a+b)*
- C: aa+bb
- D: (ab+ba)(aa+bb)*
View Answer
A
Q43: Two regular expressions are said to be equivalent if they generate the same ______.
- A: alphabet
- B: transition table
- C: language
- D: state diagram
View Answer
C
Q44: Which regular expression generates strings of even length over Σ = {a, b}?
- A: ((a+b)(a+b))*
- B: (a+b)a(a+b)
- C: (a+b)((a+b)(a+b))*
- D: ab
View Answer
A
Q45: The language of strings, defined over Σ = {a, b}, of words starting with aa and ending with bb
- A: (a+b)*
- B: aa(a+b)*bb
- C: ab
- D: aa+bb
View Answer
B
Q46: The language generated by any regular expression is called a ______ language.
- A: finite
- B: recursive
- C: regular
- D: irregular
View Answer
C
Q47: Which of the following expressions generates all possible strings over Σ = {a, b}?
- A: ab
- B: (a+b)*
- C: a+b
- D: (ab+ba)*
View Answer
B
Q48: A regular language is the language generated by ______.
- A: any regular expression
- B: finite automaton
- C: alphabet
- D: transition diagram
View Answer
A
Q49: The finite set of input letters from which input strings are formed is denoted by ______.
- A: Σ
- B: transition table
- C: transition diagram
- D: states
View Answer
A
Q50: In a finite automaton, transitions show how to move from one ______ to another.
- A: state
- B: alphabet
- C: input string
- D: letter
View Answer
A