This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.
Non-ambiguous CFG for $\{ a^{n_0} b a^{n_1} b \ldots a^{n_{m-1}} b a^{n_m} \mid m\geq 1 \wedge (n_0 = \sum_{1\leq i\leq m} n_i) \}$
Write a non-ambiguous CFG generating the words of the form
$a^{n_0}ba^{n_1}b\ldots a^{n_{m-1}} b a^{n_m}$, with $m\geq 1$, such that
$n_0$ is equal to the sum $n_1+n_2+\ldots+n_m$.
Authors: Guillem Godoy
/
Documentation: