This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.

Non-ambiguous CFG for $\{ a^i b^j \mid i\geq j \vee i\leq 2j \}$

Write a **non-ambiguous** CFG generating the words of the form $a^ib^j$ where
the number of $a$’s is at least the number of $b$’s, or it is at most twice the
number of $b$’s.

Authors: Guillem Godoy
/

Documentation: