# Pushdown Automata: acceptance of a string

1 vote
424 views
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.

Point number one the pushdown automata will accept the language by the property of acceptance by final state it does not matter what symbols are remaining in the stack but the input string should be completely scanned.

For point number 2 if a string does not belong to a language then it will not accepted by a pushdown automata or  as you told it might lead to a non final state on scanning the complete string so to accept any string first it should be completely scanned and then reach to final state or can be accepted by emptying the stack.

Pushdown automata will not accept a string on scanning half.
0
Thank you

## Related questions

1
80 views
given a pushdown automata that receives L by getting to an accepting state, how can a pushdown automata be built, so that it accepts L*? (might use a “double bottom” if needed)?? i don’t know how to solve it and would appreciate any kind of help! studying for exam and must learn how to solve it
Options: $\left \{ \left ( b^{n}ab^{n}a\right )^{m} | n,m \geq 0 \right \}$ $\left \{ \left ( b^{n}ab^{n}a\right )^{m} | n,m \geq 0 \right \} \cup \left \{ b^{n} | n\geq 0 \right \}$ $\left \{ \left ( b^{n}ab^{n}\right )^{m}a | n,m \geq 0 \right \}$ $NONE$
$\overline{L(M)}$ is Regular DCFL but not regular CFL but not DCFL Recursive but not CFL