Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q451: What does the input TAPE of an FA accommodate?
- A: Only strings of fixed length
- B: All possible strings
- C: Only binary strings
- D: Only terminal symbols
View Answer
B
Q452: In an FA, what does the START state represent?
- A: Final state
- B: Initial state
- C: Read state
- D: Reject state
View Answer
B
Q453: How is the ACCEPT state represented in an FA?
- A: By a filled circle
- B: By an empty circle
- C: By a square
- D: By a diamond
View Answer
A
Q454: What does the REJECT state signify in an FA?
- A: The process has ended successfully
- B: The process has ended with an error
- C: The machine is still running
- D: The machine is paused
View Answer
B
Q455: In the new format of FA, what is a READ state used for?
- A: To add a letter to the STACK
- B: To remove a letter from the STACK
- C: To read an input letter and lead to another state
- D: To initialize the machine
View Answer
C
Q456: What is the function of the PUSH operation in a STACK?
- A: To remove a letter from the STACK
- B: To add a letter at the top of the STACK
- C: To read a letter from the TAPE
- D: To move to the next state
View Answer
B
Q457: How does the POP operation affect the STACK?
- A: It adds a letter to the top
- B: It removes the letter from the top
- C: It replaces the letter at the top
- D: It moves to the next state
View Answer
B
Q458: What is the effect of popping an empty STACK?
- A: The machine halts
- B: The machine crashes
- C: It reads a blank character ∆
- D: The machine continues to read
View Answer
C
Q459: What language does the FA with the format ∆ → REJECT, READ → a, b, ACCEPT recognize?
- A: (a+b)bb(a+b)
- B: (a+b)*a
- C: (a+b)*b
- D: (a+b)*ab
View Answer
A
Q460: In a PDA, what does the PUSH state do?
- A: Removes the top letter from the STACK
- B: Adds a letter to the top of the STACK
- C: Reads a letter from the TAPE
- D: Moves to a new state
View Answer
B