Exercise 14:

Non-ambiguous CFG for {an0ban1banm1banmm1(n0=1imni)}\{ 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 an0ban1banm1banma^{n_0}ba^{n_1}b\ldots a^{n_{m-1}} b a^{n_m}, with m1m\geq 1, such that n0n_0 is equal to the sum n1+n2++nmn_1+n_2+\ldots+n_m.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.