Define Push Down Automata.
Answers
Answered by
1
Pushdown Automata is a finite automata with extra memory called stack which helps Pushdown automata to recognize Context Free Languages. A Pushdown Automata (PDA) can be defined as : ... In a given state, PDA will read input symbol and stack symbol (top of the stack) and move to a new state and change the symbol of stack.
Similar questions
Math,
6 months ago
Social Sciences,
6 months ago
Science,
6 months ago
Computer Science,
1 year ago
Chemistry,
1 year ago
Science,
1 year ago