edited by
1,227 views
1 votes
1 votes

Assume $\sum = \left \{ a,b \right \}$ 

  1. $L = \left \{ w : n_{a}\left ( w \right ) = n_{b}\left ( w \right ) + 1 \right \}$
  2. $L = \left \{ w : n_{a}\left ( w \right ) > n_{b}\left ( w \right ) \right \}$
  3. $L = \left \{ w : n_{a}\left ( w \right ) = 2n_{b}\left ( w \right ) \right \}$
  4. $L = \left \{ w \in \left \{ a,b \right \}^{*} : \left |n_{a}\left ( w \right ) - n_{b}\left ( w \right ) \right | = 1 \right \}$
edited by

3 Answers

Best answer
4 votes
4 votes

1) S -> aX / XS

  X -> XX / aXb / bXa / $\epsilon$ ( Thanks  @Tarun kushwaha 1 )



2) S-> aSb | bSa | SS |A

     A-> aA | a

3) S-> aaSb | bSaa |aSba|abSa|SS|ε (thanks @srestha)

4)S -> aX | bX | XS

  X -> aXb | bXa | XX |ε

edited by
0 votes
0 votes
are the following grammars correct ?

1.     S-> aA / Aa

        A -> aAbA / bAaA / ϵ

2.    S -> aSbS / bSaS / aS / a

3.    S -> aaSbS / bSaaS /  ϵ

4.    S -> aSbS / bSaS / a /b

Related questions

0 votes
0 votes
0 answers
2
1 votes
1 votes
1 answer
3
Mk Utkarsh asked Feb 26, 2018
357 views
Find the grammar for the following language$L = \left \{ w: \left | w \right | mod 3 \geq \left | w \right | mod 2 \right \}$
3 votes
3 votes
1 answer
4