Theory of Automata MCQs with Answers
Practice important Theory of Automata MCQs with answers and explanations.
Multiple Choice Questions
Q461: What happens when the PDA reads the string aaabbb?
- A: It is rejected
- B: It is accepted after processing
- C: It enters a loop
- D: It crashes
View Answer
B
Q462: How does the PDA handle the null string?
- A: It rejects it
- B: It accepts it if only blank characters are left
- C: It processes it like any other string
- D: It cannot process it
View Answer
B
Q463: What does the new format of FAs include to accept context-free languages?
- A: An enhanced input TAPE
- B: A PUSHDOWN STACK
- C: More states
- D: Larger TAPE size
View Answer
B
Q464: In the example of a PDA processing the string aaabbb, what happens when the TAPE is empty and STACK contains only ∆?
- A: The machine rejects the string
- B: The machine accepts the string
- C: The machine continues to process
- D: The machine restarts
View Answer
B
Q465: What does a READ state in an FA do when processing the input string?
- A: Reads an input letter and transitions to another state
- B: Adds the letter to the STACK
- C: Removes the top letter from the STACK
- D: Rejects the input
View Answer
A
Q466: What operation is performed by the POP state in a PUSHDOWN STACK?
- A: Adds a letter to the top
- B: Removes a letter from the top
- C: Reads a letter from the TAPE
- D: Initializes the machine
View Answer
B
Q467: Which of the following describes the language accepted by the PDA with the format shown in the example?
- A: {anbn : n = 0,1,2,...}
- B: {a^nb^n : n > 0}
- C: {a^nb^n : n < 0}
- D: {anbm : n ≠ m}
View Answer
A
Q468: What language does the PDA with the table for running the string aaabbb accept?
- A: {anbn : n=0,1,2,3,…}
- B: {anbm : n ≠ m}
- C: {anbm : n < m}
- D: {anbm : n > m}
View Answer
A
Q469: In the PDA example for EVEN EVEN language, what does the PUSH X state do?
- A: Adds X to the top of the STACK
- B: Removes X from the STACK
- C: Reads X from the TAPE
- D: Moves to the REJECT state
View Answer
A
Q470: What does the READ state in a nondeterministic PDA do?
- A: Reads the next letter from the TAPE
- B: Pops a letter from the STACK
- C: Adds a letter to the STACK
- D: Transitions to the ACCEPT state
View Answer
A