Constructing PDA to accept language $L=\{a^i b^j c^k \mid k\geq \min(i,j)\}$ How can I construct a PDA which accepts the language   $\{a^i b^j c^k \mid k\geq \min(i,j)\}$
I think about different solutions such as building a stack with two-state. one state is for $i &lt; j$ and another is for $i &gt; j$, But I think it doesn't work.
also, The idea of poping and pushing a and b is not good. I tried it. Can Someone give me a little hint?
Your idea to differentiate between $i&lt;j$ and $i &gt;j$ is good.
To help you building the PDA, note that $L = \{a^ib^jc^k | k \geq i\} \cup \{a^ib^jc^k|k\geq j\}$.
I hope that hint is enough.