This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.
Deterministic uniquely-accepting PDA for $\{ xcy \mid x,y\in\{a,b\}^* \wedge |x|_{ab}=|y|_{ba} \}$
Write a deterministic uniquely-accepting PDA recognizing the words of the
form $xcy$, where $x,y$ are words over $\{a,b\}$ such that the number of
occurrences of $ab$ in $x$ is equal to the number of occurrences of $ba$ in
$y$.
Authors: Guillem Godoy
/
Documentation: