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

Non-ambiguous CFG for the complement of $\{ a^n b^n \mid n\geq 0 \}$

Write a **non-ambiguous** CFG generating the language of words over $\{a,b\}$
that are not of the form $a^nb^n$, where $n\geq 0$.

Authors: Guillem Godoy
/

Documentation: