Consider automaton M below is M a dpda If not then argue why

Consider automaton M below. is M a dpda? If not, then argue why.

Solution

This is NDPDA ( Non-deterministic push down automata ).

because, it doesn\'t give transition for every input symbol in each state.which is non-determinism.here the input symbols are { a,b,c }.

For a DPDA, it is must to give exactly one transition for every input symbol in each state. here in any of the state q0,q1,q2,q3,q4 transition is not given for every input symbol.

******************END***************PLS GIVE ME GOOD RATING*************************