Automata methods in transcendence
From MaRDI portal
Publication:2197705
Summary: The purpose of this expository article is to explain diverse new tools that automata theory provides to tackle transcendence problems in function field arithmetic. We collect and explain various useful results scattered in computer science, formal languages, logic literature and explain how they can be fruitfully used in number theory, dealing with transcendence, refined transcendence and classification problems. For the entire collection see [Zbl 1441.14003].
Recommendations
- scientific article; zbMATH DE number 4071019
- scientific article; zbMATH DE number 1121923
- Automata and transcendence in positive characteristic
- Profinite Methods in Automata Theory
- scientific article; zbMATH DE number 860125
- Automata-style proof of Voloch's result on transcendence
- Automata and algebraicity
- Verification, Model Checking, and Abstract Interpretation
- scientific article; zbMATH DE number 1033559
Cites work
- A proof of the Mahler-Manin conjecture
- A transcendence criterion in positive characteristic and applications
- Algebraic elements in formal power series rings
- Algebraic Functions Over a Field of Positive Characteristic and Hadamard Products
- Algebraic functions over finite fields
- Algebraic independence of arithmetic gamma values and Carlitz zeta values
- Automata and transcendence in positive characteristic
- Automata and transcendence of the Tate period in finite characteristic
- Automata-style proof of Voloch's result on transcendence
- Automates et valeurs de transcendance du logarithme de Carlitz
- Automatic Sequences
- Carlitz \(\zeta\)-function and automata
- Carlitz-Goss gamma function, Wade's method, and transcendence
- Critères de non-automaticité et leurs applications
- Diophantine approximation in finite characteristic
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- Finite automata and algebraic extensions of functions fields
- Finite Automata and the Set of Squares
- Finite automata in number theory
- scientific article; zbMATH DE number 418901 (Why is no real title available?)
- scientific article; zbMATH DE number 2130773 (Why is no real title available?)
- scientific article; zbMATH DE number 3902039 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 409905 (Why is no real title available?)
- scientific article; zbMATH DE number 1229927 (Why is no real title available?)
- scientific article; zbMATH DE number 1121923 (Why is no real title available?)
- scientific article; zbMATH DE number 940594 (Why is no real title available?)
- scientific article; zbMATH DE number 847766 (Why is no real title available?)
- Hypergeometric functions for function fields and transcendence
- Linear combinations of \(\zeta(s)/ \Pi^ s\) over \(F_ q(x)\) for \(1\leq s\leq q-2\)
- Logic and p-recognizable sets of integers
- Multiplicative functions and \(k\)-automatic sequences
- Note sur un article de Sharif et Woodcock
- On the base-dependence of sets of numbers recognizable by finite automata
- On the complexity of algebraic numbers
- Some transcendental functions over function fields with positive characteristic.
- Suites algébriques, automates et substitutions
- Sur la transcendance de la série formelle Π
- The algebraic closure of the power series field in positive characteristic
- Transcendence in positive characteristic and special values of hypergeometric functions
- Transcendence of elliptic modular functions in characteristic \(p\)
- Transcendence of gamma values for \(\mathbb{F}_ q [T]\)
- Transcendence of the Carlitz-Goss gamma function at rational arguments
- Transcendence, automata theory and gamma functions for polynomial rings
- Uniform tag sequences
Cited in
(8)- Automata and transcendence in positive characteristic
- Combinatorial proofs for transcendency of formal power series.
- Automata in SageMath -- combinatorics meet theoretical computer science
- scientific article; zbMATH DE number 4071019 (Why is no real title available?)
- scientific article; zbMATH DE number 97081 (Why is no real title available?)
- A determinant of the Artin-Hasse exponential coefficients
- Profinite Methods in Automata Theory
- Transcendence properties of the Artin-Hasse exponential modulo p
This page was built for publication: Automata methods in transcendence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197705)
