This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.

Deterministic uniquely-accepting PDA for $\{ a^{2n} b^n \mid n\geq 0 \}$

Write a **deterministic uniquely-accepting** PDA recognizing the words of the
form $a^{2n}b^n$, with $n\geq 0$.

Authors: Guillem Godoy
/

Documentation: