Exercise 4:

Non-ambiguous CFG for {aibjij}\{ a^i b^j \mid i\leq j \}
Write a non-ambiguous CFG generating the words of the form aibja^ib^j where the number of aa’s is at most the number of bb’s.
Authors: Guillem Godoy / Documentation:
To be able to submit you need to either log in, register, or become a guest.