adplus-dvertising
frame-decoration

Question

A string is accepted by a PDA when

a.

Stack is empty

b.

Acceptance state

c.

both a and b

d.

None of the mentioned

Answer: (c).both a and b

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. A string is accepted by a PDA when

Similar Questions

Discover Related MCQs

Q. The following move of a PDA is on the basis of:

Q. If two sets, R and T has no elements in common i.e. RÇT=Æ, then the sets are called

Q. Which among the following is not a part of the Context free grammar tuple?

Q. A context free grammar is a ___________

Q. The closure property of context free grammar includes :

Q. Which of the following automata takes stack as auxiliary storage?

Q. Which of the following automata takes queue as an auxiliary storage?

Q. A context free grammar can be recognized by

Q. A null production can be referred to as:

Q. The context free grammar which generates a Regular Language is termed as:

Q. NPDA stands for

Q. The production of the form A->B , where A and B are non terminals is called

Q. Halting states are of two types. They are:

Q. A push down automata can be represented as:
PDA= ε-NFA +[stack]

State true or false:

Q. A pushdown automata can be defined as: (Q, ∑, G, q0, z0, A, d)
What does the symbol z0 represents?

Q. Which of the following correctly recognize the symbol ‘|-‘ in context to PDA?

Q. Which among the following is true for the given statement?
Statement :If there are strings R and T in a language L so that R is prefix of T and R is not equivalent to T.

Q. Which of the following can be accepted by a DPDA?

Q. For a counter automaton, with the symbols A and Z0, the string on the stack is always in the form of __________

Q. State true or false:
Statement: Counter Automaton can exist for the language L={0^i1^i|i>=0}