reopened by
1,990 views
3 votes
3 votes

Identify the language generated by the following grammar
$S\rightarrow AB\\ A\rightarrow aAb\mid \varepsilon\\ B\rightarrow bB\mid b$

  1. $\{a^m b^n\mid n\geq m,m>0\}$
     
  2. $\{a^m b^n\mid n\geq m,m\geq0\}$
     
  3. $\{a^m b^n\mid n> m,m>0\}$
     
  4. $\{a^m b^m\mid n> m,m\geq0\}$
reopened by

2 Answers

2 votes
2 votes

S→AB       = am bb+ = {am bn  |n>m , m>=0}

A→aAb∣ε  = am bm

B→bB∣b    = b+

D is answer

Answer:

Related questions

5 votes
5 votes
2 answers
1
gatecse asked Dec 17, 2017
1,191 views
Which of the following are context-free?$A=\{a^n b^n\, a^mb^m\mid m,n\geq0\}$$B=\{a^m b^n\, a^mb^n\mid m,n\geq0\}$$C=\{a^mb^n\mid m\neq 2n,\,m,n\geq0\}$A and B only A and...
1 votes
1 votes
1 answer
2
gatecse asked Dec 17, 2017
1,025 views
Let $L=\{a^p\mid p \text{ is a prime}\}.$ Then which of the following is trueIt is not accepted by a Turing MachineIt is regular but not context-freeIt is context-free b...
4 votes
4 votes
1 answer
3
4 votes
4 votes
2 answers
4
gatecse asked Dec 17, 2017
3,376 views
Consider the grammar with productions$S\rightarrow aSb\mid SS \mid \varepsilon$This grammar is not context-free, not linearnot context-free, linearcontext-free, not linea...