edited by
166 views
1 votes
1 votes

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
edited by

1 Answer

Related questions

1 votes
1 votes
1 answer
1
gatecse asked Mar 2, 2018
313 views
The total number of words represented by the regular expression (^ + a + b) (^ + a + b) (^ + a + b) is815169
1 votes
1 votes
2 answers
3
gatecse asked Mar 2, 2018
1,013 views
A turing machine crashesIf the machine reads all the input characters without traversing some state.If the machine traverses all its states till the input remainsIf the t...
0 votes
0 votes
2 answers
4
gatecse asked Mar 2, 2018
762 views
Bluetooth uses ____ method in physical layer to avoid interference from other devices or other networksFHSSFDSSTDSNone of the above