made eaasy mock 6

Question

Consider the following languages :
L₁ : Set of all strings of form {a^pb^qp + q = 500} over alphabet Σ = {a, b}.
L₂ : Set of all strings of form {a^pb^qp – q = 500} over alphabet Σ = {a, b}.
Which of the above languages is regular ?

A) L1

B) L2

C) Both

D) None of these

Answer 1

L1 is regular since it contain finite set of strings

Comments

what about L2...??

---

Li is regular p+q =500, for this we have finite no. of values for p and q

L2 is not regular: p-q = 500, we have infinite values of p and q e.g p =q+500...we can't limit this