Pushdown Automata (Introduction) — Study Resources & PYQs

Introduction to pushdown automata

Estimated study time: 48 minutes

Study resources

Push-down Automata (Article) — Introduction to PDA: stack-based automaton for context-free languages, formal definition, and acceptance modes.

Pushdown Automata (Introduction) previous year questions

(a) Construct a PDA for the following language : (10) $$L = \{a^n b^{2n} \mid n \ge 1\}$$ (b) Design a PDA for odd palindrome over {a, b}. (10)
What do you mean by Push Down Automata? Design a Pushdown Automata for the language $L = \{0^m 1^n \mid m = n \text{ or } m = 2n \}$

Taught in these subjects

Theory of Computation — CST-3504 · Government College of Engineering and Technology, Jammu

Open on CachedInfo