Pushdown Automata

Question 1

What is the goal of pushdown automata? What is special about it?

Answer 1

Question 2

What is a step relation in a pushdown automaton?

Answer 2

Question 3

How does a transition work in an NPDA (pushdown automaton)?

Answer 3

Thus from action a[b/c], a is removed from the input, b is removed from the stack in favour of b.

Question 4

What is the definition of an empty stack language?

Answer 4

Question 5

How can we change an NPDA with a non-empty stack into one that finishes with an empty stack?

Answer 5

Question 6

How can we change an NPDA with empty stack into one that does not neccesarily have one?

Answer 6

Question 7

What is this proof?

Answer 7

Question 8

How to go from context-free grammar to NPDA?

Answer 8

Question 9

How do you go from NPDA (pushdown) to context-free?

Answer 9

Question 10

What is a DPDA?

Answer 10

Question 11

What is a NPDA?

Answer 11

pushdown automaton (with stack)