I think using pumping lemma we can say it is non regular

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

$L=\left \{ a^{n}:\text{n is the product of two prime number} \right \}$$L$ is regular or non regular?

0

you can understand this way,

since it is infinite language 'n' should be in AP(Arithmetic progression), (ex : in place of 'n', if it were 2p+1 or 5p or 9p+100 where p is any natural number....etc then it would have been in AP) then only loop can be formed, thats what pumpimg lemma says, => if a loop cant be formed in an infinite language, then it is not regular.

in the above language, n is product of two prime numbers, so we cant form a loop.

since it is infinite language 'n' should be in AP(Arithmetic progression), (ex : in place of 'n', if it were 2p+1 or 5p or 9p+100 where p is any natural number....etc then it would have been in AP) then only loop can be formed, thats what pumpimg lemma says, => if a loop cant be formed in an infinite language, then it is not regular.

in the above language, n is product of two prime numbers, so we cant form a loop.

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 5.9k
- Digital Logic 2.3k
- Programming & DS 4.3k
- Algorithms 3.7k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.4k
- CO & Architecture 2.9k
- Computer Networks 3.4k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 482
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 16

40,927 questions

47,580 answers

146,425 comments

62,311 users