Prove that the following are not regular languages using Pum

Prove that the following are not regular languages. using Pumping lemma

a) L = {1w|w belong to * , where 1w is a prime}, = {0, 1}

Solution

Given:machine

    L = {1w|w belong to * , where 1w is a prime}, = {0, 1}

if we write a language:

       it may be 10,11,100,111,101,110, -------

   in this 11 , 101 prime

      10,100,111,110, ------- are not primes

              this not regularly genarate prime numbers.