MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Construction of Push Down Automata Part - 1

Let L=wkwrwϵa...

Question

Let $L = {w k w^{r} w ϵ {a, b}^{*}}$ where $w^{r}$ is reverse of w and $\sum = l$ is L accepted by any PDA?

A

None of these

No worries! We‘ve got your back. Try BYJU‘S free classes today!

B

No

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

Yes

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

D

Depends on k

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C Yes
Yes

Suggest Corrections

thumbs-up

0

Similar questions

Q. Consider the following sets

L_{1}

L_{2}

L_{1} = {L | L accepted by " PDA by final state " over Σ = {a, b}}

L_{2} = {L | L accepted by " PDA by Empty state " over Σ = {a, b}}

Which of the relation is correct?

Q. Consider the following statements:

I. If L is the language accepted by some DPDA, then L has an unambiguous CFG.

II. PDA with acceptance by final state is equivalent to PDA with acceptance by empty stack.

Which of the above statements is correct?

Q. Let P be a non-deterministic push-down automation (NPDA) with exactly one state, q, and exactly one symbol, Z, in its stack alphabet. State q is both the starting as well as the accepting state of the PDA. The stack is initialized with one Z before the start of the operation of the PDA. Let the input alphabet of the PDA be Σ.
Let L(P) be the language accepted by the PDA by reading a string and reaching its accepting state. Let N(P) be the language accepted by the PDA by reading a string and emptying its stack. Which of the following statements is TRUE?

Q. Consider the following problems L(G) denotes the language generated by a grammar G.L(M) denotes the language accepted by a machine M.
I. For an unrestricted grammar G and a string w, whether w

ϵ

L(G).
II. Given a Turing Machine M, whether L(M) is regular.
III. Given two grammars

G_{1} a n d G_{2},

(G_{1}) = L (G_{2})

.
IV. Given an NFA N, whether there is a deterministic PDA P such that N and P accept the same language.
Which one of the following statements is correct?

Q. Consider the transition diagram of a PDA given below with input alphabet

\sum = {a, b}

and stack alphabet

Γ = {X, Z}, Z

is the initial stack symbol.
Let L denote the language accepted by the PDA.

Which one of the following is TRUE?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Construction of Pushdown Automata Part - 1

OTHER

Watch in App

explore_more_icon

Explore more

Construction of Push Down Automata Part - 1

Join BYJU'S Learning Program

CrossIcon