This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.
Non-ambiguous CFG for $\{ xcy \mid x,y\in\{a,b\}^* \wedge |x|_a=|y|_b \}$
Write a non-ambiguous CFG generating the words of the form $xcy$, where
$x,y$ are words over $\{a,b\}$ such that the number of occurrences of $a$ in
$x$ is equal to the number of occurrences of $b$ in $y$.
Authors: Guillem Godoy
/
Documentation: