Describe a PDA that accepts the language L = {w | w = a^n b^n c^n , N > 0}

Question

I was wondering could somebody give me an idea on how to answer this. This computation should start with an empty string >q0---->q1. How does the stack be incorporated into this question? sorry, new to this, any advice would be great.

Describe a PDA that accepts the language L = {w | w = a^n b^n c^n , N > 0}

Answer 1

This language is probably the most classic example of language that is not context-free, so it cannot be recognized by a pushdown automaton. The fact that it is not context-free is easily demonstrated using the pumping lemma for context-free languages; in fact, that article uses it to demonstrate the use of the lemma.