Infinitude of Primes Using Formal Languages

DOI10.1080/00029890.2018.1496761zbMath1435.68185DBLPjournals/tamm/Thakkar18arXiv2005.10372OpenAlexW3106154930WikidataQ58123013 ScholiaQ58123013MaRDI QIDQ4685121

Aalok Thakkar

Publication date: 5 October 2018

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.10372

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Primes (11A41)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Theory of computation.
• Linear Automaton Transformations
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• On Context-Free Languages

This page was built for publication: Infinitude of Primes Using Formal Languages