Week 2 - Pushdown Automata

Question 1

What is a pushdown automata?

Answer 1

Is similar to a Finite Automaton, except that it also has a stack (A memory) that dicticts along with the input what the next transition is in the machine.

Question 2

What is the stack in a pushdown automata?

Answer 2

Kind of like a written memory. The machine writes to it, and depending one what is at the top of the stack and the input the machine may do certain things. When it reads from the top of the stack, the top of the stack is ‘popped’ or deleted.

Question 3

TRUE OR FALSE: Transistions of the pushdown automata are non-deterministic.

Answer 3

TRUE.