480 views
1 votes
1 votes
Show that the language $L=${$a^nb^nc^m,n\neq m$} is not context-free.

2 Answers

0 votes
0 votes
The language is not context free because we need to do $2$ types of comparisons.

One for checking whether $a^n$=$b^n$ and second for checking whether $n \neq m$ satisfies or not.
0 votes
0 votes
The language is not context free as we require two comparisons , for that we require two stacks (turing machine).

Related questions

0 votes
0 votes
0 answers
3
0 votes
0 votes
1 answer
4