论文标题
使用正式语言理论的素数无限
Infinitude of Primes Using Formal Language Theory
论文作者
论文摘要
形式语言是一组由特定规则所描述的符号字符串。在本说明中，我们讨论了某种类似于普通语言的形式语言，并提出了一些基本的结果。然后，采用这些语言的属性来证明有很多质数。
Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of these languages are then employed to prove that there are infinitely many prime numbers.
