Question

Q 46 From the given PDA M with two states {q0.q1), how many possible productions will get for the transition õ(q0, a,20)= {(q0,
AS)} while converting from PDA to CFG.
Ops: A.
O 2
O1
O4
D.
O9​

Answer 1

Answer⤵️⤵️

PDA is an automaton with finite states and the memory can be unbounded. With the application of a PDA, it will be able to recognize a CFG that looks like this: {0^n 1^n | n∈ ℕ}. A PDA can be different types of transitions, such as expansions, reductions, and conditional.

Answer 2

Answer:

pda is an automaton with finite state and the money can be unbounded with the application of PDA it will be able to recognize a CFG that look like this:(0N1NEN) .A PDA can be different type of transitions such as expansion reductions