Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Chapter: 4
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)*
Correct Answer:
B
Chapter: 4
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)*
Correct Answer:
A
Chapter: 4
Q43:
Two regular expressions are said to be equivalent if they generate the same ______.
A. alphabet
B. transition table
C. language
D. state diagram
Correct Answer:
C
Chapter: 4
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
Correct Answer:
A
Chapter: 4
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
Correct Answer:
B
Chapter: 4
Q46:
The language generated by any regular expression is called a ______ language.
A. finite
B. recursive
C. regular
D. irregular
Correct Answer:
C
Chapter: 4
Q47:
Which of the following expressions generates all possible strings over Σ = {a, b}?
A. ab
B. (a+b)*
C. a+b
D. (ab+ba)*
Correct Answer:
B
Chapter: 4
Q48:
A regular language is the language generated by ______.
A. any regular expression
B. finite automaton
C. alphabet
D. transition diagram
Correct Answer:
A
Chapter: 4
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
Correct Answer:
A
Chapter: 4
Q50:
In a finite automaton, transitions show how to move from one ______ to another.
A. state
B. alphabet
C. input string
D. letter
Correct Answer:
A
Chapter: 4
Q51:
A transition table shows ______.
A. states of a game board
B. transitions between states
C. input letters
D. regular expressions
Correct Answer:
B
Chapter: 4
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
Correct Answer:
D
Chapter: 4
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
Correct Answer:
C
Chapter: 4
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)*
Correct Answer:
B
Chapter: 4
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
Correct Answer:
B
Chapter: 4
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)
Correct Answer:
B
Chapter: 4
Q57:
What does r1+r2 represent in terms of languages L1 and L2?
A. L1 ∪ L2
B. L1L2
C. L1 ∩ L2
D. L1-L2
Correct Answer:
A
Chapter: 4
Q58:
A finite automaton has a finite number of ______.
A. alphabets
B. states
C. transitions
D. all of the above
Correct Answer:
B
Chapter: 4
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
Correct Answer:
B
Chapter: 4
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
Correct Answer:
B