edited by
1,977 views
2 votes
2 votes
Q3) Given,

$L_1 = (aaa^*b)$

$L_2 = (aab^*aba^*)$

Find (c) the union of $L_1$ and $L_2$, and also find (d) $L_1 - L_2$.

Q4) Find the npda's of the following:

f)  $L = \{ a^nb^m :n \leq m \leq 3n\}$

j) $L = \{w  : 2n_a(w) \leq n_b(w)) \leq 3n_a(w) \}$.
edited by

1 Answer

Related questions

656
views
0 answers
1 votes
Naveen Kumar 3 asked Apr 20, 2019
656 views
Construct npda's that accept the following regular languages.(a) $L_1 = L (aaa^*b)$.(b) $L_1 = L (aab^*aba^*)$.(c & d here)
605
views
1 answers
0 votes
Naveen Kumar 3 asked Apr 20, 2019
605 views
Is it possible to find a dfa that accepts the same language as the pda $M= (${$q_0,q_1$},{$a,b$},{$z$},$\delta,q_0,z,${$q_1$}),with ... {$(q_1,z)$}, $\delta(q_1,b,z)=${$(q_0,z)$} ?
390
views
0 answers
0 votes
Naveen Kumar 3 asked Apr 20, 2019
390 views
Find an npda for the language $L =$ {$ab (ab)^n b (ba)^n : n ≥ 0$}.
444
views
0 answers
0 votes
Naveen Kumar 3 asked Apr 20, 2019
444 views
Find an npda for the concatenation of $L (a^*)$ and the language in Exercise 6.