TOC Grammar

Question

What is the Language represented by this L = {w / where w ={a ,b}} and Na(w)>=Nb(w)+1.What is the machine which can be used to process this lang ?

Comments

Context free language

Answer 1

L = {w / where w ={a ,b}} and Na(w)>=Nb(w)+1

L has number of a's greater than or equal to number of b's +1

L={b, abb,aabb,aaabb,aabbb......................}

S⟶S₁S₂

S₂⟶aS₂b / b

S₁⟶aS₁ /∈

we can represent language like this.

In S₁ part we are representing and Na(w)>Nb(w)

In S₂ part we  are representing  Na(w)=Nb(w)+1

So, we can say it is a CFL

Comments

@kapil , it is not necessary that input is always in same order as you considered. 

for example: bbaaa belong to L . 

---

Right @praveen sir

I missed it.

---

thank you

Answer 2

L = {w / where w ={a ,b}*}

language: number of a's should be greater than number of b's in language

PDA is used to process  this language.