$L = \left \{ ab^{n}a^{n}|n>0 \right \} \bigcup  \left \{ aab^ka^{2k} | k>0 \right \}$What can be said about the given language L ?According to me, I think it is CFL and not DCFL as I tried to somehow parse it through a NPDA but not sure though.
What can be said about the given language?
pushdown automata;nondeterminism
The words in the first part start with $ab$, those in the second part start with $aa$.That should help.