GATE CS 2019 (Forenoon) — Question 17

Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMCQ1 mark · −1/3 if wrongMedium

If \( L \) is a regular language over \( \Sigma = \{a, b\} \), which one of the following languages is NOT regular?
  1. A
    \( L \cdot L^R = \{xy \mid x \in L, y^R \in L\} \)
  2. B
    \( \{ww^R \mid w \in L\} \)
  3. C
    Prefix \( (L) = \{x \in \Sigma^* \mid \exists y \in \Sigma^* \text{ such that } xy \in L\} \)
  4. D
    Suffix \( (L) = \{y \in \Sigma^* \mid \exists x \in \Sigma^* \text{ such that } xy \in L\} \)
Practise the full 2019-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on Regular and Context-Free Languages & Pumping LemmaTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group