Dark Mode

397 views

4 votes

Consider the following language

$$\mathsf{PRIMES} = \Biggl\{ \underbrace{111 \dots 11}_{p \: \text{ times} } : \: p \: \text{ is prime } \Biggl\}$$

Then, which of the following is TRUE?

- $\mathsf{PRIMES}$ is regular
- $\mathsf{PRIMES}$ is undecidable
- $\mathsf{PRIMES}$ is decidable in polynomial time
- $\mathsf{PRIMES}$ is context free but not regular
- $\mathsf{PRIMES}$ is NP-complete and P $\neq$ NP