Exercise 21:

Deterministic uniquely-accepting PDA for {xcyx,y{a,b}xaba=ybab}\{ xcy \mid x,y\in\{a,b\}^* \wedge |x|_{aba}=|y|_{bab} \}
Write a deterministic uniquely-accepting PDA recognizing the words of the form xcyxcy, where x,yx,y are words over {a,b}\{a,b\} such that the number of occurrences of abaaba in xx is equal to the number of occurrences of babbab in yy.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.