·Give context-free grammars that generate the following languages. In all parts, the alphabet E is {0,1}. Aa. {w| w contains at least three 1s} b. {w| w starts and ends with the same symbol} c. {w|...

Formal Languages and Automata Theory

Give context-free grammars that generate the following languages. In all parts, the
alphabet Σ is {0,1}

a.
{w| w contains at least three 1s}
b. {w| w starts and ends with the same symbol}
c. {w| the length of w is odd}
Ad. {w| the length of w is odd and its middle symbol is a 0}
e. {w| w = w
R, that is, w is a palindrome}
f. The empty set

Extracted text: ·Give context-free grammars that generate the following languages. In all parts, the alphabet E is {0,1}. Aa. {w| w contains at least three 1s} b. {w| w starts and ends with the same symbol} c. {w| the length of w is odd} Ad. {w| the length of w is odd and its middle symbol is a 0} e. {w| w = w*, that is, w is a palindrome} f. The empty set R