Register

Peter Linz Edition 4 Exercise 7.1 Question 3.c,3.d,4.f,4.j (Page No. 183)

• edited by
2,344 views
2 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) \}$.

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · ProgramNext → · ALGORITHM
← Previous in category · Finite AtomataNext in category → · peter linz ex. (regu...
Position:
Show:

Related questions

1 1 vote
0 0 answers
822
822 views
Naveen Kumar 3 asked Apr 20, 2019
822 views
Peter Linz Edition 4 Exercise 7.1 Question 3 (Page No. 183)
Construct npda's that accept the following regular languages.(a) $L_1 = L (aaa^*b)$.(b) $L_1 = L (aab^*aba^*)$.(c & d here)
0 0 votes
1 1 answer
891
891 views
Naveen Kumar 3 asked Apr 20, 2019
891 views
Peter Linz Edition 4 Exercise 7.1 Question 9 (Page No. 183)
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 ...
0 0 votes
0 0 answers
555
555 views
Naveen Kumar 3 asked Apr 20, 2019
555 views
Peter Linz Edition 4 Exercise 7.1 Question 8 (Page No. 183)
Find an npda for the language $L =$ {$ab (ab)^n b (ba)^n : n ≥ 0$}.
0 0 votes
0 0 answers
649
649 views
Naveen Kumar 3 asked Apr 20, 2019
649 views
Peter Linz Edition 4 Exercise 7.1 Question 7 (Page No. 183)
Find an npda for the concatenation of $L (a^*)$ and the language in Exercise 6.