34 votes 34 votes If $L$ is a regular language over $\Sigma = \{a,b\} $, which one of the following languages is NOT regular? $L.L^R = \{xy \mid x \in L , y^R \in L\}$ $\{ww^R \mid w \in L \}$ $\text{Prefix } (L) = \{x \in \Sigma^* \mid \exists y \in \Sigma^* $such that$ \ xy \in L\}$ $\text{Suffix }(L) = \{y \in \Sigma^* \mid \exists x \in \Sigma^* $such that$ \ xy \in L\}$ Theory of Computation gatecse-2019 theory-of-computation regular-language 1-mark + – Arjun asked Feb 7, 2019 • edited Nov 30, 2022 by Lakshman Bhaiya Arjun 14.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes ww^R cannot be recognized without using stack, so it cannot be regular. air1ankit answered Feb 15, 2019 air1ankit comment Share Follow See all 0 reply Please log in or register to add a comment.