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.5k
- Engineering Mathematics 7.1k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.3k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4k
- Non GATE 1.4k
- Others 1.5k
- Admissions 559
- Exam Queries 553
- Tier 1 Placement Questions 23
- Job Queries 69
- Projects 18

47,913 questions

52,293 answers

182,250 comments

67,737 users