I hope you could help me as you have done before (thanks again)
In a previous exam I saw this question; it is asked to identify if the language is Regular, CFL or Non CFL.
In my opinion this language is CFL... but, again my opinion is not good ! :/
I have think about the problem as followed :
For the first part (before the intersection) the language is a^i b^j c^k | i != j or i != k or k != j. This is a CFL since it's the union of multiple CFL languages. Am I right ? (Thanks Draconis)
Then for the second part, this is also a CFL since I could easily write a CFG of it or a PDA.
Then the intersection, it means that now the language is :
{a^i b^j c^k | (i != j or i != k or k != j) and ( i = j ) }
==> {a^i b^j c^k | i = j != k} <=== this is probably my mistake. (I don't understand why)
But my result is a CFL... unfortunately, my result is wrong.
Please help me to understant, my exam is soon and looking at my answer it doesn't look good...
Thnaks a lot in advance !