Fred created a new automaton model which is a push down automaton but with two stacks and the added ability of having commands which do not read input tape but which can pop from one stack and push into the other.This new automaton can recognize (choose strongest result)
A)Context Free Language
B)Context sensitive language
C)Regular language
D)Languages recognizable by Turing machine

Question

Quizplus · Accepted Answer

A pushdown automaton with two stacks can simulate a Turing machine. Each stack can simulate one half of the Turing machine's tape (to the left and to the right of the head, respectively). The ability to move data between stacks allows for the simulation of the head movement on the Turing tape. Therefore, this automaton can recognize languages that are recognizable by Turing machines, which includes all recursively enumerable languages.

Fred Created a New Automaton Model Which Is a Push