in Theory of Computation edited by
7,964 views
21 votes
21 votes

Consider the following languages:

  • $L1=\left\{ww \mid w \in \{a,b\}^*\right\}$
  • $L2=\left\{ww^R \mid w \in \{a,b\}^*, w^R \text{ is the reverse of w} \right\}$
  • $L3=\left\{0^{2i} \mid \text{ i is an integer} \right\}$
  • $L4= \left\{ 0^{i^2} \mid \text{ i is an integer} \right\}$

Which of the languages are regular?

  1. Only $L1$ and $L2$
  2. Only $L2, L3$ and $L4$
  3. Only $L3$ and $L4$
  4. Only $L3$
in Theory of Computation edited by
8.0k views

1 comment

L3: By default, we have to assume i is a positive integer(including 0) as the number of zeros(string length) can never be negative.
0
0

5 Answers

0 votes
0 votes

$$O^{2i}$$


                                                                                            Can be Written as

$$OO^{i}$$

                                                                                           and can be any positive integer

                                                                                           Therefore Option D is correct

Answer:

Related questions