Register

Peter Linz Edition 4 Exercise 1.2 Question 14 (Page No. 28)

421 views
1 votes
1 votes
Let $Σ$ = {$a, b$}. For each of the following languages, find a grammar that generates it.
(a) $L_1$ = {$a^nb^m : n ≥ 0, m > n$}.
(b) $L_2$ = {$a^nb^{2n} : n ≥ 0$}.
(c) $L_3$ = {$a^{n+2}b^n : n ≥ 1$}.
(d) $L_4$ = {$a^nb^{n−3} : n ≥ 3$}.
(e) $L_1 L_2$.
(f) $L_1 ∪ L_2$.
(g) $L_1^3$.
(h) $L_1^*$.
(i) $L_1-\bar{L}_4$.
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
Naveen Kumar 3 asked Mar 19, 2019
948 views
Peter Linz Edition 4 Exercise 1.2 Question 13 (Page No. 28)
What language does the grammar with these productions generate? $S \rightarrow Aa$ , $A \rightarrow B$ , $B \rightarrow Aa$ .
What language does the grammar with these productions generate?$S \rightarrow Aa$ ,$A \rightarrow B$ ,$B \rightarrow Aa$ .
User Avatar
0 votes
0 votes
2 answers
3
Naveen Kumar 3 asked Mar 19, 2019
415 views
Peter Linz Edition 4 Exercise 1.2 Question 12 (Page No. 28)
Give a simple description of the language generated by the grammar with productions $S \rightarrow aA,$ $A \rightarrow bS,$ $S \rightarrow λ.$
Give a simple description of the language generated by the grammar with productions$S \rightarrow aA,$$A \rightarrow bS,$$S \rightarrow λ.$
User Avatar
Link Copied!