The GATE Grind

GATE 2007 CS – Question 31

Theory of Computation · Regular and Context-Free Languages, Pumping Lemma · 2 marks · Multiple choice

Which language is regular? Here wᴿ denotes reversal and + means nonempty strings.

  1. $\{ww^R\mid w\in\{0,1\}^+\}$
  2. $\{ww^Rx\mid x,w\in\{0,1\}^+\}$
  3. $\{wxw^R\mid x,w\in\{0,1\}^+\}$
  4. $\{xww^R\mid x,w\in\{0,1\}^+\}$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) $\{wxw^R\mid x,w\in\{0,1\}^+\}$

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Regular and Context-Free Languages, Pumping Lemma questions

All Regular and Context-Free Languages, Pumping Lemma questions →