![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Abstract
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.
Key words:
Acknowledgments
The author is grateful to Professor Aiswarya Cyriac and Professor K. Narayan Kumar for their valuable guidance, to Gayathri Shankar and Nivedita Ganesh for help with phrasing and presentation, and to the anonymous referees for their comments which helped improve this note significantly. The editorial team and the editor have been very kind in assisting the drafting and revision process.