The language defined is $\{a^m b^n \mid 0 \leq n \leq m \leq 3n\}$. This means for each string in the language, the number of $a$'s, denoted by $m$, and the number of $b$'s, denoted by $n$, must satisfy the condition that $n$ is at most $m$ and $m$ is at most
Show more…