Consider the following sets L1 and L2- L1 - L- L accepted by - PDA by final state - over- - a- b L2 - L- L accepted by - PDA by Empty state - over- - a- b Which of the relation is correct-

Option (a) L_1 = L_2 nbsp; Set of all CFLs Note: PDA by Final state ≅ PDA by Empty stack. ...

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

Introduction to PDA

Consider the ...

Question

Consider the following sets $L_{1}$ and $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?

Open in App

Solution

Suggest Corrections

Similar questions

L_{1} \cap L_{2}

L_{1} a n d L_{2}

L_{1}

a^{m} b^{m} c a^{n} b^{n} | m, n \geq 0

L_{2}

a^{i} b^{j} c^{k} | i, j, k \geq 0

L_{1}

L_{2}

L_{1}

L_{2}

L_{1} = {a^{n} ∣ n \geq 0}

L_{2} = {b^{n} ∣ n \geq 0}

L_{1} \cdot L_{2}

L_{1} \cdot L_{2} = {a^{n} b^{n} ∣ n \geq 0}

Join BYJU'S Learning Program