Better: Use nondeterminism to decide when to stop popping A’s and start pushing B’s for extra b’s.
For every 'a' read, push a symbol (e.g., 'A') onto the stack. pda for a-ib-jc-k where j i k
But that’s tricky: if we are in q1, top Z, we know we exhausted a’s. But still b’s may come — we go to q2 and read b’s. Better: Use nondeterminism to decide when to stop
by ensuring that every 'b' in the input is "accounted for" by exactly one 'a' and one 'c' . The condition push a symbol (e.g.
Provide a step-by-step trace for a sample string like . Homework 6 Solutions - NJIT