Language L1 is defined by the grammar- S1- aS1b - -Language L2 is defined by the grammar- S2- abS2 - -Consider the following is TRUE -P - L1 is regularQ - L2 is regularWhich one of the following is TRUE-

G_1 : S_1→ aS_1b | ε G_2 : S_2→ abS_2 | ε L_1=L(G_1)={ a^nb^n |n≥0 } L_2=L(G_2)={ (ab)^n |n≥0 } = (ab)* Clearly L_1 is regular is FALSE and L_2 ...

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

Summation by Sigma Method

Language L1 i...

Question

$L a n g u a g e L_{1} i s d e f i n e d b y t h e g r a m m a r :$
$S_{1} \to a S_{1} b | ε$
$L a n g u a g e L_{2} i s d e f i n e d b y t h e g r a m m a r :$
$S_{2} \to a b S_{2} | ε$
$C o n s i d e r t h e f o l l o w i n g i s T R U E ?$
$P : L_{1} i s r e g u l a r$
$Q : L_{2} i s r e g u l a r$
$Which one of the following is TRUE?$

Both P and Q are false

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

P is true and Q is false

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

P is false and Q is true

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

Both P and Q are true

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

Open in App

Solution

Suggest Corrections

Similar questions

L_{1} and L 2

L_{1}

L_{2}

D C F L .

L_{3} = (L_{1} \cap L_{2}^{*})^{'}

L_{3}

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} \cup L_{2} .

L_{1} L_{2}

L_{1} \cup L_{2}

_{1}

L_{1} - R

L_{1} \cap L_{2}

L_{1} = {a^{n} b^{m} c^{n + m} : m, n \geq 1}

L_{2} = {a^{n} b^{n} c^{2 n} : n \geq 1}

Join BYJU'S Learning Program