Answers
Theory of Computing - PDA
- Course
- Institution
- Book
A pushdown automaton (PDA) is a finite state machine which has additional stack storage. The transitions a machine makes are based not only on the input and current state but also on the stack. The formal definition (in our textbook) is that a PDA is this: M = (K,Σ,Γ,Δ,s,F)
[Show more]