retagged by
816 views
0 votes
0 votes

Give context-free grammars generating the following languages.

  1. The set of strings over the alphabet $\{a,b\}$ with more $a's$ than $b's$
  2. The complement of the language $\{a^{n}b^{n}\mid n\geq 0\}$
  3. $\{w\#x\mid w^{R}$ $\text{is a substring of $x$ for }$ $w,x \in\{0,1\}^{*}\}$
  4. $\{x_{1}\#x_{2}\#...\#x_{k}\mid k\geq 1,$ $\text{each}$  $ x_{i}\in\{a,b\}^{*},$ $\text{and for some i and }$ $ j,x_{i}=x_{j}^{R}\}$
retagged by

1 Answer

0 votes
0 votes
a.  S->AaA

     A->AA | aAB | bAa | a |  ε

     B->b

b.  $\overline{L}$={$a^nb^m | n>m>1$}  $\cup$  {$a^nb^m | m>n>1$} $\cup$ {(a+b)*b(a+b)*a(a+b)*}

     Grammar for $\overline{L}$:

     S->A | B | DbDaD

     A->aaAb | aaCb

     B->aBbb | aCbb

     C->aCb | ε

     D->aD | bD | a | b | ε
edited by

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
1 answer
4
admin asked May 4, 2019
264 views
Let $\Sigma = \{a,b\}.$ Give a $CFG$ generating the language of strings with twice as many $a’s$ as $b’s.$ Prove that your grammar is correct$.$