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

Uniquely-accepting PDA for $\{ a^i b^j \mid j\leq i\leq 2j \}$

Write a **uniquely-accepting** PDA (**which cannot be deterministic**)
recognizing the words of the form $a^ib^j$ where the number of $a$’s is at
least the number of $b$’s, but at most twice the number of $b$’s.

Authors: Guillem Godoy
/

Documentation: