Use the Pumping Lemma to show that the language L containing all the words of the form a nb nc n, for any n ≥ 0, cannot be recognised by a finite automaton. How can a push-down automaton recognise...

Use the Pumping Lemma to show that the language L containing all the

words of the form a

nb

nc

n, for any n ≥ 0, cannot be recognised by a finite

automaton.

How can a push-down automaton recognise the language

{ww | w is a string of 0s and 1s and w is its mirror image}?

Give an informal description of such an automaton.