Pushdown Automata Flashcards
1
Q
What is the goal of pushdown automata? What is special about it?
A
2
Q
What is a step relation in a pushdown automaton?
A
3
Q
How does a transition work in an NPDA (pushdown automaton)?
A
Thus from action a[b/c], a is removed from the input, b is removed from the stack in favour of b.
4
Q
What is the definition of an empty stack language?
A
5
Q
How can we change an NPDA with a non-empty stack into one that finishes with an empty stack?
A
6
Q
How can we change an NPDA with empty stack into one that does not neccesarily have one?
A
7
Q
What is this proof?
A
8
Q
How to go from context-free grammar to NPDA?
A
9
Q
How do you go from NPDA (pushdown) to context-free?
A
10
Q
What is a DPDA?
A
11
Q
What is a NPDA?
A
pushdown automaton (with stack)
