NPDA question about accepting condition
By “final state” I assume you mean “accepting state”. 
The answer is no, as the accepting state should have an empty string $\epsilon$ for it to be meaningful. 

You can of course define a transition relation that consumes everything after it has reached an accepting state. It will act as a prefix detector.