In certain Pushdown Automata, will the input string considered accepted if while reading it we reach to final state but
1) the stack in not empty and contain few symbols?
AND/OR
2) there is still some remaining part of the string to be read(on processing which we might end up on some non-final state again).
An elaborate answer will be highly appreciated.