Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
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
View Answer
A
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'
View Answer
B
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
View Answer
A
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
View Answer
A
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
View Answer
A
Q186: What is the total number of possible combinations of states for FA1 and FA2?
- A: 6
- B: 5
- C: 4
- D: 7
View Answer
A
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
View Answer
A
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
View Answer
A
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
View Answer
A
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
View Answer
A