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

Deterministic uniquely-accepting PDA for $\{ w \in \{a,b\}^* \mid 2|w|_a\geq|w|_b \}$

Write a **deterministic uniquely-accepting** PDA recognizing the words over
$\{a,b\}$ such that the number of occurrences of $b$ is at most twice the
number of occurrences of $a$.

Authors: Guillem Godoy
/

Documentation: