Library

DPDA · Deterministic context-free

Nested counts: aⁿbᵐcᵐdⁿ

Two pairs of counts, one inside the other, like a function call inside a function call. The b’s are matched by the c’s on top of the stack while the a’s wait underneath for the d’s. Swap c and d and no stack can do it.

startasbsdscsdone
The machine as drawn — 6 states, 12 transitions.

The author’s examples, run

ε → acceptabcd → acceptaabbccdd → acceptaabbbbbcccccdd → accepta → rejectbbcd → rejectbabbccdd → rejectbabbbbbcccccdd → reject