Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.
Sign up to join this community
Let
$\qquad L = \{a^n \mid \exists_{p \geq n}\ p\,,\ p+2 \text{ are prime}\}.$
Is $L$ regular?
This question looked suspicious at the first glance and I've realized that it is connected with the twin prime conjecture. My problem is that the conjecture has not been resolved yet, so I am not sure how can I proceed with deciding that the language is regular.
If the twin prime conjecture is true, then $L = a^{*}$, which is regular. If the twin prime conjecture is not true, then there are finitely many twin primes; indeed, there is a largest pair of twin primes $\{p, p + 2\}$. In this case, $L = \{a^{n} | n < p + 1\}$, a finite language. In either case, you get a regular language, so I think it's safe to conclude that $L$ is a regular language... we just won't know which one it is until the twin prime conjecture is resolved.
Yes, this language is regular. The twin prime conjecture need not be resolved in order to see this:
Suppose the twin prime conjecture is true, that is, for any $n$, we can find a prime $p \geq n$ such that $p+2$ is prime. Then in particular, $L = \{ a^n | n \in N \}$, as the condition is always true. This last language is expressible by $a^*$ and hence regular.
Suppose the twin prime conjecture is false. Then there exists some $N$ such that there exists some prime $p$ such that $p+2$ is prime, and for every $n > N$, there exists no $p$ such that $p+2$ is prime. In this case, $L = \{ a^n | n \leq N \}$, which is a finite language, and therefore regular.
By case distinction, we conclude that $L$ is regular.
It is regular in either case.
