- Thread starter
- #1

- Apr 13, 2013

- 3,723

I have to show that the language [tex]\left \{ w\epsilon \left \{ a,b \right \}^{*}:w=a^{m}b^{n},m\neq n \right \} [/tex] is accepted by a pushdown automaton.

Can I use the sentence "A string is accepted by a pushdown automaton if,starting with an empty stack,there is a path through the automaton such that the automaton stops in an accepting state after the entire string has been read." to show it?