This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.
CFG for $\{ a^{n_0} b a^{n_1} b \ldots a^{n_{m-1}} b a^{n_m} \mid m\geq 1 \wedge \exists i\in\{1,\ldots,m\}: (n_0 = n_i) \}$
Write a CFG (which will be ambiguous) generating the words of the form
$a^{n_0}ba^{n_1}b\ldots a^{n_{m-1}} b a^{n_m}$ for which there exists an
$i\in\{1,\ldots,m\}$ such that $n_0=n_i$.
Authors: Guillem Godoy
/
Documentation: