Theory of Computation
Q21.
Consider the following languages. L_{1}=\{0^{p}1^{q}0^{r}|p,q,r\geq 0\} L_{2}=\{0^{p}1^{q}0^{r} | p,q,r \geq 0, p \neq r \} Which one of the following statements is FALSE?Q22.
Let L=L_{1}\cap L_{2} , where L_{1} and L_{2} are languages as defined below: L_{1}= \{a^{m}b^{m} c a^{n} b^{n}|m,n\geq 0 \} L_{2}=\{a^{i}b^{j}c^{k}|i,j,k\geq 0 \} Then L isQ23.
Consider the languages L1, L2 and L3 as given below L1=\{0^{p}1^{q}|p,q\in N\} L2=\{0^{p}1^{q}|p,q\in N and p=q\} and L3=\{0^{p}1^{q}0^{r}|p,q,r\in N \; and \; p=q=r\} Which of the following statements is NOT TRUE?Q26.
Consider the following languages. L_1 = \{a^i b^j c^k \mid i = j, k \geq 1\} L_2 = \{a^i b^j \mid j = 2i, i \geq 0\} Which of the following is true?Q27.
If L_1 and L_2 are context free languages and R a regular set, one of the languages below is not necessarily a context free language. Which one?Q29.
If L1 is context free language and L2 is a regular language which of the following is/are false?Q30.
Let L be a regular language and M be a context-free language, both over the alphabet \Sigma. Let L^c and M^c denote the complements of L and M respectively. Which of the following statements about the language L^c\cup M^c is TRUE?