## Discussion Forum

Que. | Consider alphabet ∑ = {0, 1}, the null/empty string λ and the sets of strings X0, X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0, X1 and X2 are related as follows:
X0 = 1 X1 X1 = 0 X1 + 1 X2 X2 = 0 X1 + {λ} Which one of the following choices precisely represents the strings in X0? |

a. | 10 (0* + (10)*)1 |

b. | 10 (0* + (10)*)*1 |

c. | 1(0* + 10)*1 |

d. | 10 (0 + 10)*1 + 110 (0 + 10)*1 |

Answer:1(0* + 10)*1 |