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 y^R \text{ suffix of } x \}$
Write a non-ambiguous CFG generating the words of the form $xcy$, where
$x,y$ are words over $\{a,b\}$ such that $y^R$ is suffix of $x$, i.e., such
that $x$ can be written of the form $zy^R$ for some word $z$.
Authors: Guillem Godoy
/
Documentation: