This problem is Belongs to the subject of Theory of Computation And In this subject There is a topic of context free language. so , i have a question to Show that the following language is not context free language L = {a^n b^n c^n | n <=m <= 2n}
I try to prove or show that the following language is not context free language L = {a^n b^n c^n | n <=m <= 2n} But i am confused in it and i am unable to solve it So, i except your help.
New contributor
Sujal Khadekar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.