Test: From PDA to Grammars - Computer Science Engineering (CSE) MCQ

State

Unconsumed input

Stack content

All of the mentioned

Turnstile

Shifter

Router

None of the mentioned

{0n1n|n>=0}

{0n12n|n>=0}

{02n1n|n>=0}

None of the mentioned

{ww^r|w=(a+b)*}

ε is called the initial stack symbol

Both (a) and (b)

None of the mentioned

If L is a language accepted by PDA1 by final state, there exist a PDA2 that accepts L by empty stack i.e. L=L(PDA1)=L(PDA2)

If L is a CFL then there exists a push down automata P accepting CF; ; by empty stack i.e. L=M(P)

Let L is a language accepted by PDA1 then there exist a CFG X such that L(X)=M(P)

All of the mentioned

Transition graph

Transition table

ID

All of the mentioned

true

false

For non deterministic PDA, equivalence is undecidable

For deterministic PDA, equivalence is decidable

For deterministic PDA, equivalence is undecidable.

None of the mentioned

Pushing

Popping

Replacing

All of the mentioned

Finite

Non regular

Non-deterministic

Deterministic