Construct a pda which accepts the given language L by final state


#1

construct a pda M accepting L={a^i b^j c^k | i=j or j=k} by final state


#2