Question

Consider the following
statements.
1) For any push down
automata there exists another
push down automata that
accepts the
same language but contains
only one POP state.
1) For every regular language,
there exists a push down
automata.
I) The regular language does
not contain a stack.
Which of the above
statements is/are true?
a) l and I
b) I and Il
c) Il and lI
d) All the three statements are
true.

Answer 1

Answer:

b) On a runtime stack, if the last value is POP at the offset of 00000FF1, then what will be the value of ESP if we use perform an eight-bit push operation "PUSH AL"✔✔

Explanation: