Subword complexity and finite characteristic numbers
From MaRDI portal
Recommendations
- Subword complexity and Laurent series
- scientific article; zbMATH DE number 1229927
- On the complexity of algebraic numbers. I: Expansions in integer bases
- Diophantine approximation and transcendence in finite characteristic
- Patterns of continued fractions for the analogues of \(e\) and related numbers in the function field case
Cites work
- Automates et valeurs de transcendance du logarithme de Carlitz
- Automatic Sequences
- Carlitz \(\zeta\)-function and automata
- Certain quantities transcendental over \(\text{GF}(p^n,x)\)
- scientific article; zbMATH DE number 2130773 (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 940594 (Why is no real title available?)
- Irrationality measures of Carlitz zeta values in characteristic \(p\)
- Linear combinations of \(\zeta(s)/ \Pi^ s\) over \(F_ q(x)\) for \(1\leq s\leq q-2\)
- On the complexity of algebraic numbers
- On the complexity of algebraic numbers. I: Expansions in integer bases
- On the rapid computation of various polylogarithmic constants
- RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
- Suites algébriques, automates et substitutions
- Sur la transcendance de la série formelle Π
- The Construction of Decimals Normal in the Scale of Ten
- Transcendence and special zeta values in characteristic p
- Uniform tag sequences
Cited in
(4)
This page was built for publication: Subword complexity and finite characteristic numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682405)
