Automata in number theory (Q2244820)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Automata in number theory |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Automata in number theory |
scientific article |
Statements
Automata in number theory (English)
0 references
12 November 2021
0 references
This article is a survey on the interactions between automata theory and number theory. (For an older discussion on this topic, see the paper of the reviewer [IMA Vol. Math. Appl. 109, 547--570 (1999; Zbl 0973.11032)] Here are some of the topics covered: automatic sequences and various characterizations of them, non-automaticity of the prime numbers (or any infinite subset of them), density of primes in automatic sets, transcendence of real numbers with automatic base-\(p\) expansions, resolution of Cobham's conjecture, Derksen's theorem on the zero set of a linear recurrence in a field of finite characteristic, Christol's theorem linking algebraic formal series over a finite field with automata, and Kedlaya's generalization. This is an excellent account of the main results of the field up to about 2010, and can be read profitably by anyone interested in the topic. For the entire collection see [Zbl 1470.68002].
0 references
automata
0 references
automatic sequence
0 references
number theory
0 references
algebraic numbers
0 references
radix expansions
0 references
transcendence
0 references
prime numbers
0 references
Cobham's conjecture
0 references
Christol's theorem.
0 references