Pushdown Automata Homework
Construct state diagrams for nondeterministic pushdown automata that recognized the following languages:
- \(\{a^mb^nc^{m+n}|m \ge 0, n \ge 0\}\)
- With \(\Sigma = \{\texttt{a},\texttt{b}\}, L = \{w|w = w^R\}\) (in other words, \(w\) is the same backwards and forwards, or \(w\) is a palindrome)