Department of CSE, KITSW U18CS404 THEORY OF COMPUTATION

4CSE AY:2022-23
CDT33 - LECTURE SUMMARY
CDT33 The languages of pushdown automata(PDA)

Topics Covered

Motivation This topic helps in identifying the acceptable strings for a given PDA

Lecture Learning Outcomes (LLOs): After completion of this lecture, you should be able to…
LLO1
On topic 1
Analyze whether a given string is acceptable or not by a PDA

CDT33 – Lecture Summary – Key Takeaways

Definition:

A language can be accepted by Pushdown automata using two approaches:

1. Acceptance by Final State: The PDA is said to accept its input by the final state if it enters any final state in zero
or more moves after reading the entire input.

Let P =(Q, ∑, Γ, δ, q0, Z, F) be a PDA. The language acceptable by the final state can be defined as:

1. L(PDA) = {w | (q0, w, Z) ⊢* (p, ε, ε), q ∈ F}

2. Acceptance by Empty Stack: On reading the input string from the initial configuration for some PDA, the stack of
PDA gets empty.

Prepared by: Dept of CSE, KITSW Page 1 of 2

Department of CSE, KITSW U18CS404 THEORY OF COMPUTATION
4CSE AY:2022-23
CDT33 - LECTURE SUMMARY

CDT33- LECTURE LEVEL PRACTICE PROBLEMS (LLPs) to test the LLOs

To test whether you achieved the learning outcomes of this lecture, you should be able to
solve the following LLPs, in the class itself, after completion of the lecture. Minimum one
question / problem (LLP) is designed to test each expected LLO.

1. LLP1 (on LLO1, LLO3):

Consider the following transitions and identify whether the string ‘aaabb’ is acceptable or
not.

Prepared by: Dept of CSE, KITSW Page 2 of 2