Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Chapter: 14
Q181:
The closure of an FA is similar to which operation?
A. Concatenation of FA with itself
B. Union of FAs
C. Intersection of FAs
D. Complementation of FAs
Correct Answer:
A
Chapter: 14
Q182:
In the example, what does the FA for r1 = (a+b)(a+b)* accept?
A. Any string of a and b with 'a' as second letter
B. Any string of a and b
C. Strings with at least one 'b'
D. Strings that start with 'a'
Correct Answer:
B
Chapter: 14
Q183:
In the transition diagram for the FA corresponding to r*, what does z1 represent?
A. Initial state
B. Final state
C. Non-final state
D. Intermediate state
Correct Answer:
A
Chapter: 14
Q184:
The FA for r = (a+b)*b accepts which of the following languages?
A. Strings with 'b' as the last letter
B. Strings with 'a' as the first letter
C. Strings of even length
D. Strings of odd length
Correct Answer:
A
Chapter: 14
Q185:
The method of building an FA for r1r2 is based on which principle?
A. Concatenation of corresponding languages
B. Union of languages
C. Intersection of languages
D. Complementation of languages
Correct Answer:
A
Chapter: 14
Q186:
What is the total number of possible combinations of states for FA1 and FA2?
A. 6
B. 5
C. 4
D. 7
Correct Answer:
A
Chapter: 14
Q187:
How does the FA for r* differ from the original FA?
A. It includes the initial state as a final state
B. It removes transitions
C. It adds new states
D. It ignores original final states
Correct Answer:
A
Chapter: 14
Q188:
The transition table for FA3 shows possible states based on which input?
A. A or B
B. A only
C. B only
D. Any alphabet
Correct Answer:
A
Chapter: 14
Q189:
What type of automata is being described in Kleene’s theorem part III?
A. Finite Automata
B. Pushdown Automata
C. Turing Machine
D. Mealy Machine
Correct Answer:
A
Chapter: 14
Q190:
In the concatenation method of FAs, what happens when the final state of FA1 is reached?
A. The initial state of FA2 is included
B. The process stops
C. FA1 is reset
D. FA2 is ignored
Correct Answer:
A
Chapter: 14
Q191:
What does the transition table for FA3 represent?
A. All possible states and transitions based on input
B. Only the final states
C. The initial state only
D. The rejected states
Correct Answer:
A
Chapter: 14
Q192:
Fill in the blank: Kleene’s theorem part III, method 2 focuses on the _______ of FAs.
A. concatenation
B. union
C. closure
D. intersection
Correct Answer:
A
Chapter: 14
Q193:
Fill in the blank: The closure of an FA is like the ______ of the FA with itself.
A. concatenation
B. union
C. intersection
D. complement
Correct Answer:
A
Chapter: 14
Q194:
Fill in the blank: In the FA corresponding to r = (a+b)*b, the string accepted by the automaton must end with _______.
A. b
B. a
C. a or b
D. neither
Correct Answer:
A
Chapter: 14
Q195:
Fill in the blank: The FA corresponding to r1r2 consists of states labeled _______.
A. z1, z2, z3
B. x1, x2, y1
C. s1, s2, s3
D. f1, f2
Correct Answer:
A
Chapter: 15
Q196:
What is the unique property of an NFA?
A. Multiple start states
B. Single start state
C. No start state
D. Multiple final states
Correct Answer:
B
Chapter: 15
Q197:
An NFA is a collection of how many components?
A. 2
B. 3
C. 4
D. 5
Correct Answer:
B
Chapter: 15
Q198:
Which of the following is NOT a valid input symbol in an NFA?
A. a
B. b
C. c
D. ∧
Correct Answer:
D
Chapter: 15
Q199:
What is the alphabet Σ in the NFA defined over {a, b, c}?
A. {a}
B. {a, b}
C. {a, b, c}
D. {a, c}
Correct Answer:
C
Chapter: 15
Q200:
How does an NFA accept a string?
A. If there exists one successful path
B. If all paths are successful
C. If there is no transition
D. If the input is empty
Correct Answer:
A