Regular Language
Q1.
If L is a regular language over \Sigma =\{a,b\}, which one of the following languages is NOT regular ?Q2.
A language L satisfies the Pumping Lemma for regular languages, and also the Pumping Lemma for context-free languages. Which of the following statements about L is TRUE?Q3.
For \Sigma =\{a,b\}, let us consider the regular language L=\{x|x=a^{2+3k} \; or \; x=b^{10+12k}, k\geq 0\}. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for L?Q4.
Which of the following are regular sets? I. \{a^{n}b^{2m}|n\geq 0,m\geq 0\} II. \{a^{n}b^{m}|n=2m\} III. \{a^{n}b^{m}|n\neq m\} IV. \{xcy|x,y,\in \{a,b\}^*\}Q6.
Consider the languages L_{1}=\phi abd L_{2}=\{a\}. Which one of the following represents L_{1} L_{2}^{*} \cup L_{1}^{*}?Q8.
Let L be a regular language. Consider the constructions on L below: I. \text{repeat} (L) = \{ww \mid w \in L\} II. \text{prefix} (L) = \{u \mid \exists v : uv \in L\} III. \text{suffix} (L) = \{v \mid \exists u: uv \in L\} IV. \text{half} (L) = \{u \mid \exists v: | v | = | u | \text{ and } uv \in L\} Which choice of L is best suited to support your answer above?Q9.
Which of the following languages is/are regular? L_{1}:\{wxw^{R}|w,x \in \{a,b\}^{*} \; and \; |w|,|x| \gt 0 \}, w^{R} is the reverse of string w L_{2}:\{a^{n}b^{m}|m\neq n \; and \; m,n\geq 0\} L_{3}:\{a^{p}b^{q}c^{r}|p,q,r\geq 0\}