Context Free Language
Q42.
Which of the following definitions below generate the same language as L, where L=\{x^ny^n \text{ such that } n\geq 1 \}? I. E \rightarrow xEy\mid xy II. x y \mid (x^+xyy^+) III. x^+y^+Q43.
Consider the languages L1=\{0^{i}1^{j}\;| \; i\neq j\}. L2=\{0^{i}1^{j}\;| \; i=j\}. L3=\{0^{i}1^{j}\;| \; i=2j+1\}. L4=\{0^{i}1^{j}\;| \; i \neq 2j\} Which one of the following statements is true?Q44.
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Context-free languages are:Q45.
Context-free languages and regular languages are both closed under the operation (s) of :Q46.
Define a context free languages L \in \{0, 1\}^*, \text{init} (L) = \{u \mid uv \in L for some v in \{0, 1\}^*\} ( in other words, \text{init}(L) is the set of prefixes of L) Let L = \{w \mid w \text{ is nonempty and has an equal number of $0$'s and $1$'s}\} Then \text{init}(L) is: