in Unknown Category edited by
162 views
1 vote
1 vote

Let $\Sigma = \{a, b\}$ the Context Free Grammar G

$S \rightarrow bS \: \mid \: aM$

$M \rightarrow bS \: \mid aF$

$F \rightarrow aF \mid bF \mid ^{\wedge}$

describes the language of words

  1. containing aa in them
  2. with even length
  3. starting and ending with same letter
  4. None of the above
in Unknown Category edited by
by
162 views

1 Answer

1 vote
1 vote

It is regular language containing aa.

Related questions