context free languages

Question

{a^m b^n c^m : m,n > 1}  is this cfl?

Answer 1

Yes it is CFL.

Because here we are comparing (number of a's) == (number of c's)

Language contain strings L = {aabbcc, aaaabbcccc, ..... } //Keep remember that number of b's are not required to be equal to the number of a's or c's.

talking minimum string and its further strings pattern we can draw the PDA as follow:-

Thanks..