Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Chapter: 7
Q101:
Fill in the blank: The regular expression for the language that does not end in aa or bb over Σ = {a, b} is _____.
A. (a+b)* (ab+ba)
B. Λ + a + b + (a+b)*
C. (a + b)*
D. ab + ba
Correct Answer:
A
Chapter: 7
Q102:
The transition graph for a finite automaton consists of which of the following?
A. Finite number of states and transitions
B. Infinite number of states and inputs
C. Infinite set of transitions
D. Only one start and final state
Correct Answer:
A
Chapter: 7
Q103:
The language L = {aa, bab, aabb, bbba} is accepted by which of the following finite automata?
A. FA1
B. FA2
C. FA3
D. FA4
Correct Answer:
C
Chapter: 7
Q104:
Which of the following is an example of a language accepted by a finite automaton?
A. L = {Λ, b, ab, bb}
B. L = {a, ab, bb, ba}
C. L = {a, b, bb, ba}
D. L = {Λ, a, b}
Correct Answer:
A
Chapter: 7
Q105:
Fill in the blank: The regular expression Λ + a + b + (a+b)* (ab+ba+bb) describes a language that ____.
A. Does not end in aa
B. Ends in bb
C. Contains only a and b
D. Ends with aa or bb
Correct Answer:
A
Chapter: 7
Q106:
The language L = {w belongs to {a,b}*: length(w) ≥ 2 and w does not end in aa or bb} is accepted by which FA?
A. FA1
B. FA2
C. FA3
D. FA4
Correct Answer:
C
Chapter: 8
Q107:
What does a TG stand for in automata theory?
A. Transition Gate
B. Temporal Graph
C. Transition Graph
D. Triggered Gate
Correct Answer:
C
Chapter: 8
Q108:
What is the language accepted by a TG defined as?
A. The set of all rejected strings
B. The set of all accepted strings
C. The set of final states
D. The set of all possible strings
Correct Answer:
B
Chapter: 8
Q109:
If a string has at least one path in TG from an initial state to a final state, the string is considered:
A. Rejected
B. Accepted
C. Undefined
D. Invalid
Correct Answer:
B
Chapter: 8
Q110:
Which of the following TG accepts an empty language?
A. TG1
B. TG2
C. TG3
D. All of the above
Correct Answer:
D
Chapter: 8
Q111:
In the given example, what does TG2 lack at state 1?
A. Transitions for 'a' and 'b'
B. A final state
C. A starting state
D. A transition at state 1
Correct Answer:
D
Chapter: 8
Q112:
Which regular expression describes a language L that starts with 'b' and is defined over Σ = {a, b}?
A. a(a+b)*
B. b(a+b)*
C. (a+b)aa(a+b)
D. (a+b)bb(a+b)
Correct Answer:
B
Chapter: 8
Q113:
The regular expression Λ + (a + b)*a describes which of the following languages?
A. Strings starting with 'b'
B. Strings not ending with 'b'
C. Strings containing 'aa'
D. Strings containing 'bb'
Correct Answer:
B
Chapter: 8
Q114:
Which TG accepts strings containing double 'a' over Σ = {a, b}?
A. TG1
B. TG2
C. TG3
D. All of the above
Correct Answer:
C
Chapter: 8
Q115:
The regular expression (a+b)(aa)(a+b) describes a language containing:
A. Double 'a'
B. Double 'b'
C. Strings starting with 'a'
D. Strings not ending in 'b'
Correct Answer:
A
Chapter: 8
Q116:
What is true about the TG in which states are not labeled?
A. It is still a valid TG
B. It may not be considered a single TG
C. It will reject all strings
D. It will accept all strings
Correct Answer:
B
Chapter: 8
Q117:
In the given example, what is the regular expression for strings not ending in 'b'?
A. Λ + (a + b)*a
B. (a + b)*b
C. (a + b)*a
D. (a + b)(a + b)*
Correct Answer:
A
Chapter: 8
Q118:
What does the "+" symbol represent in regular expressions?
A. OR operator
B. AND operator
C. Concatenation
D. None of the above
Correct Answer:
A
Chapter: 8
Q119:
Which of the following TGs accepts strings having double 'a' or double 'b'?
A. TG1
B. TG2
C. TG3
D. All of the above
Correct Answer:
D
Chapter: 8
Q120:
What does the expression (a+b)(aa + bb)(a+b) represent?
A. Strings starting with 'a'
B. Strings containing 'aa' or 'bb'
C. Strings ending with 'b'
D. Strings without 'a'
Correct Answer:
B