retagged by
428 views
0 votes
0 votes

Which of the following languages is regular?

  1. $L = \{ bba (ba)^* a^{n-1} \mid  n> 0 \}$
  2. $L = \{a^nb^n \mid n < 1000 \}$
  3. $L = \{a^nb^k \mid \text{ n is odd or k is even} \}$
  4. $L = \{ wxw^R \mid w,x \in (0+1)^* \}$
  1. $1$, $3$ and $4$
  2. $2, 3, 4$
  3. $2, 3$
  4. $1, 2, 3, 4$
retagged by

1 Answer

Best answer
1 votes
1 votes
Sir Plz explain . The number of strings in L2 are limited so  L2 should be regular.Option D should be correct.
selected by
Answer:

Related questions

2 votes
2 votes
1 answer
3