Question: 1. Use the pumping lemma for regular languages to prove L is not regular where L = {1^r | r is a prime number}. 2.

1. Use the pumping lemma for regular languages to prove L is not regular where L = {1^r | r is a prime number}.

2. Use the pumping lemma for CFG to show L = {1^r | r is a prime number} above is not a CFL. (This also implies the answer to problem 1, but do problem 1 anyhow.)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!