On asymptotically automatic sequences
From MaRDI portal
Publication:6619686
DOI10.4064/aa230619-26-4MaRDI QIDQ6619686
Publication date: 16 October 2024
Published in: Acta Arithmetica (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- (Non)Automaticity of number theoretic functions
- Substitutions in dynamics, arithmetics and combinatorics
- The ring of \(k\)-regular sequences
- Uniform distribution of generalized polynomials
- The ring of \(k\)-regular sequences. II.
- Multiplicative functions and \(k\)-automatic sequences
- A canonical form and the distribution of values of generalized polynomials
- Mock characters and the Kronecker symbol
- Multiplicative automatic sequences
- On completely multiplicative automatic sequences
- A note on multiplicative automatic sequences
- Distribution of values of bounded generalized polynomials
- A generalization of Cobham's theorem for regular sequences
- THE MINIMAL GROWTH OF A -REGULAR SEQUENCE
- THE LOGARITHMICALLY AVERAGED CHOWLA AND ELLIOTT CONJECTURES FOR TWO-POINT CORRELATIONS
- Completely multiplicative functions taking values in ${-1,1}$
- Transcendence of generating functions whose coefficients are multiplicative
- The value distribution of additive arithmetic functions on a line
- Transcendence of power series for some number theoretic functions
- Uniform distribution of generalized polynomials of the product type
- Automatic Sequences
- Sparse generalised polynomials
- Polynomials Involving the Floor Function.
- Correlations of multiplicative functions and applications
- An Extension of Weyl’s Equidistribution Theorem to Generalized Polynomials and Applications
- On multiplicative automatic sequences
- A note on multiplicative automatic sequences, II
- Automatic Sequences and Generalised Polynomials
- Sequences with minimal block growth
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials
- Generalised polynomials and integer powers
- An asymptotic version of Cobham’s theorem
This page was built for publication: On asymptotically automatic sequences
