Exercise 9:

Non-ambiguous CFG for {aibjiji2j}\{ a^i b^j \mid i\geq j \vee i\leq 2j \}
Write a non-ambiguous CFG generating the words of the form aibja^ib^j where the number of aa’s is at least the number of bb’s, or it is at most twice 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.