adplus-dvertising
frame-decoration

Question

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

a.

Moves

b.

transition function

c.

or/not symbol

d.

none of the mentioned

Answer: (a).Moves

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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}

Q. Let ∑={0,1}* and the grammar G be:
S->ε

S->SS

S->0S1|1S0

State which of the following is true for the given

Q. The instantaneous PDA is has the following elements

Q. The moves in the PDA is technically termed as:

Q. Which of the following assertion is false?

Q. A push down automata can represented using:

Q. State true or false:
Statement: Every context free grammar can be transformed into an equvalent non deterministic push down automata.

Q. Which of the following are the actions that operates on stack top?

Q. A push down automata is said to be _________ if it has atmost one transition around all configurations.

Q. The transition a Push down automaton makes is additionally dependent upon the:

Q. A PDA machine configuration (p, w, y) can be correctly represented as:

Q. |-* is the __________ closure of |-

Q. With reference of a DPDA, which among the following do we perform from the start state with an empty stack?

Q. A DPDA is a PDA in which:

Q. State true or false:
Statement: For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.

Q. If the PDA does not stop on an accepting state and the stack is not empty, the string is:

Q. A language accepted by Deterministic Push down automata is closed under which of the following?