Question

Q. Give one Trs example for a PDA (not found below) and add a comment in English next to it describing what it

means. If _____ then ______________.

Trs(q0, Ɛ, Z) = (q1, AZ) // push A

Trs(q0, b, Z) = (q0, BZ) // push B

Trs(q0, b, Z) = (q1, Ɛ) // pop Z

Trs(q0, b, Z) = (q1, Z) // replace Z with Z no change

Trs(q0, b, Z) = (q1, T) // pop Z and push T

Answer 1

Result Input Accept Reject Reject Reject Reject Reject Accept Reject b ,Z; BZ abb aabb qo ba q1 Load Inputs Run Inputs Clear Enter Lambda View Trace

The given PDA does not have any final stack so we assume that the string will be accepted when the stack is empty.

The only transition which leads to the empty stack is Trs(q0, b, Z) = (q1, Ɛ). So the PDA only accepts the string 'b'.