Exercise 9:

Uniquely-accepting PDA for {aibjji2j}\{ 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 aibja^ib^j where the number of aa’s is at least the number of bb’s, but at most twice the number of bb’s.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.