Which data structure is used to push down automata?
Answers
Answered by
0
Answer:
But finite automata can be used to accept only regular languages. Pushdown Automata is a finite automata with extra memory called stack which helps Pushdown automata to recognize Context Free Languages. ... Γ is the set of pushdown symbols (which can be pushed and popped from stack) q0 is the initial state.
Similar questions