edited by
14,907 views
34 votes
34 votes

If $L$ is a regular language over $\Sigma = \{a,b\} $, which one of the following languages is NOT regular?

  1. $L.L^R = \{xy \mid x \in L , y^R \in L\}$
  2. $\{ww^R \mid w \in L \}$
  3. $\text{Prefix } (L) = \{x \in \Sigma^* \mid \exists y \in \Sigma^* $such that$ \ xy \in L\}$
  4. $\text{Suffix }(L) = \{y \in \Sigma^* \mid \exists x \in \Sigma^* $such that$ \ xy \in L\}$
edited by

5 Answers

1 votes
1 votes
ww^R cannot be recognized without using stack, so it cannot be regular.
Answer:

Related questions

50 votes
50 votes
6 answers
1
Arjun asked Feb 7, 2019
34,292 views
For $\Sigma = \{a ,b \}$, let us consider the regular language $L=\{x \mid x = a^{2+3k} \text{ or } x=b^{10+12k}, k \geq 0\}$. Which one of the following can be a pumping...
21 votes
21 votes
7 answers
2
Arjun asked Feb 7, 2019
9,168 views
The expenditure on the project _____ as follows: equipment Rs.$20$ lakhs, salaries Rs.$12$ lakhs, and contingency Rs.$3$ lakhs.break downbreakbreaks downbreaks
11 votes
11 votes
6 answers
3
Arjun asked Feb 7, 2019
5,778 views
The search engine’s business model ____ around the fulcrum of trust.revolvesplayssinksbursts
8 votes
8 votes
4 answers
4