Exercise 1:

Deterministic uniquely-accepting PDA for {anbnn0}\{ a^n b^n \mid n\geq 0 \}
Write a deterministic uniquely-accepting PDA recognizing the language over {a,b}\{a,b\} where the first half of each word only contains aa’s and the second half only contains bb’s.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.