adplus-dvertising
frame-decoration

Question

Which of the following option resembles the given PDA?

a.

{0^n1^n|n>=0}

b.

{0^n1^2n|n>=0}

c.

{0^2n1^n|n>=0}

d.

None of the mentioned

Answer: (a).{0^n1^n|n>=0}

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 option resembles the given PDA?

Similar Questions

Discover Related MCQs

Q. Which of the following correctly resembles the given state diagram?

Q. A push down automaton employs ________ data structure.

Q. State true or false:
Statement: The operations of PDA never work on elements, other than the top.

Q. Which of the following allows stacked values to be sub-stacks rather than just finite symbols?

Q. A non deterministic two way, nested stack automaton has n-tuple definition. State the value of n.

Q. Push down automata accepts _________ languages.

Q. The class of languages not accepted by non deterministic, nonerasing stack automata is _______

Q. A push down automaton with only symbol allowed on the stack along with fixed symbol.

Q. Which of the operations are eligible in PDA?

Q. A string is accepted by a PDA when

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: